Strategi Kombinasi Untuk Menyelesaikan Quadratic Assignment Problem

LAMPIRAN
Lampiran 1 Matriks Had12
F = [0

1

2

2

3

4

4

5

3

5


6

7;

1

0

1

1

2

3

3

4


2

4

5

6;

2

1

0

2

1

2


2

3

1

3

4

5;

2

1

2

0


1

2

2

3

3

3

4

5;

3

2


1

1

0

1

1

2

2

2

3

4;


4

3

2

2

1

0

2

3

3

1


2

3;

4

3

2

2

1

2

0

1


3

1

2

3;

5

4

3

3

2

3


1

0

4

2

1

2;

3

2

1

3


2

3

3

4

0

4

5

6;

5

4


3

3

2

1

1

2

4

0

1

2;

6

5

4

4

3

2

2

1

5

1

0

1;

7

6

5

5

4

3

3

2

6

2

1

0]

D = [0

3

4

6

8

5

6

6

5

1

4

6;

3

0

6

3

7

9

9

2

2

7

4

7;

4

6

0

2

6

4

4

4

2

6

3

6;

6

3

2

0

5

5

3

3

9

4

3

6;

8

7

6

5

0

4

3

4

5

7

6

7;

5

9

4

5

4

0

8

5

5

5

7

5;

6

9

4

3

3

8

0

6

8

4

6

7;

6

2

4

3

4

5

6

0

1

5

5

3;

5

2

2

9

5

5

8

1

0

4

5

2;

1

7

6

4

7

5

4

5

4

0

7

7;

4

4

3

3

6

7

6

5

5

7

0

9;

6

7

6

6

7

5

7

3

2

7

9

0]

52

53
Lampiran 2 Matriks Esc16b
F = [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0;0 0 2 2 2 2 2 2 2 2 2 0 1 1 1 1;
0 2 0 2 2 2 2 2 2 2 2 0 1 1 1 1;0 2 2 0 2 3 2 2 2 2 2 0 1 1 1 1;
0 2 2 2 0 2 2 2 2 2 2 0 1 1 1 1;0 2 2 3 2 0 2 2 2 2 3 0 1 1 1 1;
0 2 2 2 2 2 0 2 2 2 2 0 1 1 1 1;0 2 2 2 2 2 2 0 2 2 2 0 1 1 1 1;
0 2 2 2 2 2 2 2 0 2 2 0 1 1 1 1;0 2 2 2 2 2 2 2 2 0 2 0 1 1 1 1;
0 2 2 2 2 3 2 2 2 2 0 0 1 1 1 1;0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0;
0 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1;0 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1;
0 1 1 1 1 1 1 1 1 1 1 0 1 1 0 1;0 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0]

D = [0 0 0 1 0 1 1 2 0 1 1 2 1 2 2 3;0 0 1 0 1 0 2 1 1 0 2 1 2 1 3 2;
0 1 0 0 1 2 0 1 1 2 0 1 2 3 1 2;1 0 0 0 2 1 1 0 2 1 1 0 3 2 2 1;
0 1 1 2 0 0 0 1 1 2 2 3 0 1 1 2;1 0 2 1 0 0 1 0 2 1 3 2 1 0 2 1;
1 2 0 1 0 1 0 0 2 3 1 2 1 2 0 1;2 1 1 0 1 0 0 0 3 2 2 1 2 1 1 0;
0 1 1 2 1 2 2 3 0 0 0 1 0 1 1 2;1 0 2 1 2 1 3 2 0 0 1 0 1 0 2 1;
1 2 0 1 2 3 1 2 0 1 0 0 1 2 0 1;2 1 1 0 3 2 2 1 1 0 0 0 2 1 1 0;
1 2 2 3 0 1 1 2 0 1 1 2 0 0 0 1;2 1 3 2 1 0 2 1 1 0 2 1 0 0 1 0;
2 3 1 2 1 2 0 1 1 2 0 1 0 1 0 0;3 2 2 1 2 1 1 0 2 1 1 0 1 0 0 0]

Lampiran 3 Matriks Esc16c
F = [0 0 2 0 2 0 2 2 0 0 0 0 0 0 0 0;0 0 2 3 1 2 0 0 2 2 2 2 2 2 0 0;
2 2 0 1 5 0 2 2 0 0 0 0 0 0 0 0;0 3 1 0 1 2 0 0 2 2 2 2 2 2 0 0;
2 1 5 1 0 0 2 2 0 0 0 0 0 0 0 0;0 2 0 2 0 0 0 0 2 2 2 2 2 2 0 0;
2 0 2 0 2 0 0 2 0 0 0 0 0 0 0 0;2 0 2 0 2 0 2 0 0 0 0 0 0 0 0 0;
0 2 0 2 0 2 0 0 0 2 3 3 3 2 0 0;0 2 0 2 0 2 0 0 2 0 2 2 2 2 0 0;
0 2 0 2 0 2 0 0 3 2 0 4 3 2 0 0;0 2 0 2 0 2 0 0 3 2 4 0 4 2 0 0;
0 2 0 2 0 2 0 0 3 2 3 4 0 2 0 0;0 2 0 2 0 2 0 0 2 2 2 2 2 0 0 1;
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0;0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0]

D = [0 0 0 1 0 1 1 2 0 1 1 2 1 2 2 3;0 0 1 0 1 0 2 1 1 0 2 1 2 1 3 2;
0 1 0 0 1 2 0 1 1 2 0 1 2 3 1 2;1 0 0 0 2 1 1 0 2 1 1 0 3 2 2 1;
0 1 1 2 0 0 0 1 1 2 2 3 0 1 1 2;1 0 2 1 0 0 1 0 2 1 3 2 1 0 2 1;
1 2 0 1 0 1 0 0 2 3 1 2 1 2 0 1;2 1 1 0 1 0 0 0 3 2 2 1 2 1 1 0;
0 1 1 2 1 2 2 3 0 0 0 1 0 1 1 2;1 0 2 1 2 1 3 2 0 0 1 0 1 0 2 1;
1 2 0 1 2 3 1 2 0 1 0 0 1 2 0 1;2 1 1 0 3 2 2 1 1 0 0 0 2 1 1 0;
1 2 2 3 0 1 1 2 0 1 1 2 0 0 0 1;2 1 3 2 1 0 2 1 1 0 2 1 0 0 1 0;
2 3 1 2 1 2 0 1 1 2 0 1 0 1 0 0;3 2 2 1 2 1 1 0 2 1 1 0 1 0 0 0]

54
Lampiran 4 Matriks Esc16h
F = [0 1 1 1

1

1

1

1

1

1

1 1 1 1 0 1;1 0 1 1

1

1

1

1

1

1

1 1 1 1 0 1;

1 1 0 1

1

1

1

1

1

1

1 1 1 1 0 1;1 1 1 0

7

7

7

7

7

7

7 1 1 1 0 1;

1 1 1 7

0 21 21 21 21 21 21 2 2 2 1 1;1 1 1 7 21

1 1 1 7 21 21

0 21 21 21 21 21 2 2 2 1 1;

0 21 21 21 21 2 2 2 1 1;1 1 1 7 21 21 21

1 1 1 7 21 21 21 21

0 21 21 21 2 2 2 1 1;

0 21 21 2 2 2 1 1;1 1 1 7 21 21 21 21 21

0 21 2 2 2 1 1;

1 1 1 7 21 21 21 21 21 21

0 2 2 2 1 1;1 1 1 1

2

2

2

2

2

2

2 0 6 6 4 1;

1 1 1 1

2

2

2

2

2

2

2 6 0 6 4 1;1 1 1 1

2

2

2

2

2

2

2 6 6 0 4 1;

0 0 0 0

1

1

1

1

1

1

1 4 4 4 0 0;1 1 1 1

1

1

1

1

1

1

1 1 1 1 0 0]

D = [0 0 0 1 0 1 1 2 0 1 1 2 1 2 2 3;0 0 1 0 1 0 2 1 1 0 2 1 2 1 3 2;
0 1 0 0 1 2 0 1 1 2 0 1 2 3 1 2;1 0 0 0 2 1 1 0 2 1 1 0 3 2 2 1;
0 1 1 2 0 0 0 1 1 2 2 3 0 1 1 2;1 0 2 1 0 0 1 0 2 1 3 2 1 0 2 1;
1 2 0 1 0 1 0 0 2 3 1 2 1 2 0 1;2 1 1 0 1 0 0 0 3 2 2 1 2 1 1 0;
0 1 1 2 1 2 2 3 0 0 0 1 0 1 1 2;1 0 2 1 2 1 3 2 0 0 1 0 1 0 2 1;
1 2 0 1 2 3 1 2 0 1 0 0 1 2 0 1;2 1 1 0 3 2 2 1 1 0 0 0 2 1 1 0;
1 2 2 3 0 1 1 2 0 1 1 2 0 0 0 1;2 1 3 2 1 0 2 1 1 0 2 1 0 0 1 0;
2 3 1 2 1 2 0 1 1 2 0 1 0 1 0 0;3 2 2 1 2 1 1 0 2 1 1 0 1 0 0 0]

Lampiran 5 Komunikasi Personal
Peter Hahn
To
Faiz Ahyaningsih
Jul 3 at 12:52 AM
Dear Faiz Ahyaningsih,
Please find attached the computer outputs of the solutions of the Had 16,
Had 18 and Had20, each of which took place on Sept 17th, 2002.
The calculations were made on a Sun Workstation:

Sun Ultra 10
Workstation

A22UGC1A9QB256CPE

FW85040735
#10908970(cpu)

BE AWARE THAT THE SOLUTION COSTS ARE MULTIPLIED BY 1000 BECAUSE THE PROBLEM
COSTS WERE MULTIPLIED BY 1000.

Runtimes are given at the end of each file in

seconds. I have no runtimes for the smaller problem instances.
Peter Hahn
Visiting Scholar, Operations and Information Department, The Wharton School,
University of Pennsylvania.