00 Interaction Edisi MGB 11-Dec-2013

MAJELIS GURU BESAR
INSTITUT TEKNOLOGI BANDUNG
INTERACTION THEORY
[NEW PARADIGM] FOR SOLVING THE TRAVELING
SALESMAN PROBLEM (TSP)
Anang Zaini Gani

11 Desember 2013, Bandung
Balai Pertemuan Ilmiah ITB
SEJARAH SINGKAT
1965 :
1966 :
1969 :
1987 :
1988 :
1992 :
2012 :
Mengembangkan suatu metode untuk : TSP

dan Facilities Planning. GaTech USA
Interaction Theory, ITB, Bandung, Indonesia
PLANET, GaTech USA
Aplikasi untuk TSP. (the ORSA / TIMS) St.
Louis, MO. USA
Aplikasi untuk Transportation Problem, (the
ORSA / TIMS) Washington DC. USA
Dihadapan Senat Guru Besar ITB
International Workshop on Optimal Network
Topologies (IWONT)
AZG
2013
AZG
2013
AZG
2013
AZG
2013
AZG
2013
INTRODUCTION
OBJECTIVE
BACKGROUND
INTERACTION THEORY
COMPUTATIONAL
EXPERIENCES AND
EXAMPLE
CONCLUSION
(Keywords: Graph; P vs NP; Combinatorial Optimization;

Traveling Salesman Problem; Complexity Theory; Interaction
Theory; Linear Programming; Integer Programming ;
Network).
7
AZG
2013
INTRODUCTION
AZG
2013
The area of Applications :

Robot control
Road Trips
Mapping Genomes
Customized Computer Chip
Constructing Universal DNA Linkers
Aiming Telescopes, X-rays and lasers
Guiding Industrial Machines
Organizing Data
X-ray crytallography
Tests for Microprocessors Scheduling Jobs
Planning hiking path in a nature park
Gathering geophysical seismic data
Vehicle routing
Crystallography
Drilling of printed circuit boards
Chronological sequencing
9
AZG
2013
The problem of TSP is to find the shortest

possible route to visit N cities exactly once and
returns to the origin city.
The TSP very simple and easily stated but it is

very difficult to solve.
The TSP - combinatorial problem
the alternative routes exponentially increases

by the number of cities.
1/2 (N-1)!
4 cities = 3 possible routes
4 times to 16 cities = to 653,837,184,000.
10 times to 40 cities =1,009 x1046
IF 100,000 CITIES...... (possible routes?)
10
AZG
2013
4
123-4
4
1233-1
4
1324-1
AZG
2013
AZG
2013
AZG
2013
AZG
2013
SOAL 33 KOTA
ALTERNATIVE RUTE 32!/2 =

131.565.418.466.846.756.083.609.606.080.000.000
KOMPUTER PALING TOP $ 133.000.000 ROADRUNNER

CLUSTER DARI UNITED STATES DEPARTMENT OF
ENERGY DIMANA 129.6600 CORE MACHINE TOPPED
THE 2009 RANKING OF THE 500 WORLDS FASTES
SUPER COMPUTERS, DELIVERING UP TO 1.547
TRILION ARITHMETIC OPERATIONS PER SECOND.
DIPERLUKAN WAKTU 28 TRILIUN TAHUN

SEDANGKAN UMUR UNIVERS HANYA 14
MILIAR TAHUN (W. Cook)
INI MEMANG GILA
AZG
2013
7 (tujuh)
problem
matematika
pada
millenium ini
1. The Birch and SwinnertonDyer Conjecture

2. The Poincare Conjecture
3. Navier-Stokes Equations
4. P versus NP Problem
5. Riemann Hypothesis
6. The Hodge Conjecture
7. Yang-Mills Theory and The
Mass Gap Hypothesis.
AZG
2013
150 CITIES
CH 150
150 cities = 5.7134x10262

Alternative routes
85
142
143
82
95
107
132
137
18
100
5
65
50
97
75
135
114
58
103
1
87
26
98
84
56
89
73
48
33
52
10
94
88
59
138
139
131
77
14
122
36
38
127
64
61
11
147
144
145
112
69
39
41
129
130
148
57
71
60
128
27
136
119
118
101
44
91
24
72
68
12
116
23
49
45
40
67
32
80
150
104
28
51
109
78
115
53
15
21
42
120
43
12
47
16
133
149
22
20
134
121
79
62
105
110
46
54
111
113
92
2
37
25
126
35
96
63
90
19
29
81
93
30
99
141
124
34
76
108
83
146
102
70
55
106
13
31
74
123
17
66
117
140
17
AZG
2013
150 CITIES
CH 150
85
142
132
143
82
107
137
18
100
95
65
50
97
75
55
135
114
58
87
26
103
98
84
89
73
35
33
92
52
94
105
79
88
59
42
138
51
139
109
131
77
40
12
67
24
32
78
14
122
118
116
23
80
36
38
69
127
101
61
11
150
72
39
49
115
147
64
104
44
144
145
41
129
130
148
57
112
45
28
53
15
21
120
43
125
47
16
133
149
110
20
134
121
2
37
25
46
54
111
62
90
126
10
113
81
93
96
63
48
19
29
56
30
22
99
141
124
8
34
76
108
86
83
146
102
70
71
60
128
27
136
68
91
119
106
13
31
74
123
17
66
117
140
18
AZG
2013
The shortest traveling salesman route going through all 13,509

cities in the United States with a population of at least 500 (as of
1998). Illustration: Courtesy of David Applegate, Robert Bixby,
Vasek Chvatal and William Cook
AZG
2013
OBJECTIVE
20
AZG
2013
. "The P versus NP
Problem" is considered one
of the seven greatest
unsolved mathematical
problems
21
AZG
2013
One important statement about the NPcomplete problem (Papadimitriou & Steiglitz) :
a. No NP-complete problem can be solved by
any known polynomial algorithm (and this is
the resistance despite efforts by many brilliant
researchers for many decades).
b. If there is a polynomial algorithm for any NPcomplete problem, then there are polynomial
algorithms for all NP-complete problems.
THIS IS CHALLENGE TO PROVE

P= NP MUST BE PURSUED!
22
AZG
2013
BACKGROUND
23
AZG
2013
The class of problem :

(P problem) solved in polynomial time
(NP Problem). that cannot be solved in
polynomial time
P vs NP
impossible to solve the NP-complete problem in
polynomial time, (P NP).
OR
NP problem can be solved in P time (P = NP).
until now no-one has been able to prove whether

P NP or P = NP.
If the TSP can be solved using an algorithm in
polynomial time, this will prove that NP problem
can be solved in polynomial time (P = NP).
24
AZG
2013
TSP dealing with the resources :

1. Time (how many iteration it takes to
solve a problem)
2. space (how much memory it takes to
solve a problem).
THE MAIN PROBLEM :
1. THE NUMBER OF STEPS (TIME) INCREASES
EXPONENTIALLY ALONG WITH THE INCREASE IN
THE SIZE OF THE PROBLEM.
2. HUGE AMOUNT COMPUTER RESOURCES ARE
REQUIRED
NEW PARADIGM
(BREAKTHROUGH)
25
AZG
2013
PARADIGM
OLD
1. LP & DERIVATIVES
2. HEURISTIC (PROBABILISTIC)
3. PROCEDURE IS
COMPLICATED
4. NEEDS RESOURCES OF TIME
AND MEMORY UNLIMITED
5. CHECKING ALL ELEMENTS
6. P = NP VS P NP ?
7. KNOWLEDGE IS HIGH
8. LONG OPERATING TIME
NEW
1.
2.
3.
4.
INTERACTION THEORY
DETERMINISTIC
PROCEDURE IS SO SIMPLE
RESOURCES NEED IS
LIMITED
5. CHECKING LIMITED
ELEMENTS (PRIORITY)
6. P=NP
7. SIMPLE ARITHMATIC
8. SHORT OPERATING TIME
(EFFICIENT AND EFFECTIVE)
26
AZG
2013
SUMMARIZES THE MILESTONES OF SOLVING

TRAVELING SALESMAN PROBLEM.
Year
Research Team
Size of Instance
1954
G. Dantzig, R. Fulkerson, and S.

Johnson
49 cities
1971
M. Held and R.M. Karp
64 cities
1975
P.M. Camerini, L. Fratta, and F.

Maffioli
67 cities
1977
M. Grtschel
120 cities
1980
H. Crowder and M.W. Padberg
318 cities
1987
M. Padberg and G. Rinaldi
1987
M. Grtschel and O. Holland
1987
M. Padberg and G. Rinaldi
2,392 cities
1994
D. Applegate, R. Bixby, V.
Chvtal, and W. Cook
7,397 cities
1998
D. Applegate, R. Bixby, V.
Chvtal, and W. Cook
13,509 cities
(4 Years)
532 cities
(109,5 secon)
666 cities
27
AZG
2013
SUMMARIZES THE MILESTONES OF SOLVING

TRAVELING SALESMAN PROBLEM.
Year
Research Team
Size of Instance
2001
D. Applegate, R. Bixby, V. Chvtal,

and W. Cook
15,112 cities
(ca. 22 Years)
2004

W. Cook and K. Helsgaun
24,978 cities
2006

and W. Cook
85,900 cities
2009

and W. Cook
1,904,711 cities
2009
Yuichi Nagata
100.000
Mona Lisa
28
AZG
2013
TECHNIQUE AND METHOD

FOR SOLVING TSP
HEURISTIC
NEURAL NETWORK
GENETIC ALGORITHM
SIMULATED ANNEALING
ARTIFICIAL INTELLEGENT
EXPERT SYSTEM
FRACTAL
TABU SEARCH
NEAREST NEIGBOR
THRESHOLD ALGORITHM
ANT COLONY OPTIMIZATION
EXACT SOLUTION
LINEAR PROGRAMMING
INTEGER PROGRAMMING
CUTTING PLANE
DYNAMIC PROGRAMMING
THE MINIMUM SPANNING
TREE
LAGRANGE RELAXATION
ELLIPSOID ALGORITHM
PROJECTIVE SCALING
ALGORITHM
BRANCH AND BOUND
ASAINMENT
29
AZG
2013
OBJECTIVE FUNCTION
n
z x(i, j)d(i, j)
i1 j 1
d(i,j) = (direct) distance between

city i and city j.
30
Constraints
AZG
2013
n
x(i, j) 1 , i 1,2,...,n
j 1
n
x(i, j) 1 , j 1,2,...,n
i 1
Each city must be exited exactly once

Each city must be entered exactly once
Subtour elimination constraint
x(i, j) S 1, S {1, 2,...,n}
i , jS
S = subset of cities
|S| = cardinality of S (# of elements in S)
There are 2n such sets !!!!!!!
AZG
2013
NUMBER OF LINIER INEQUALITIES

AS CONSTRAINS IN TSP
If n=15 the number of countraints is

1.993.711.339.620
If n=50 the number of countraints 1060

If n=120 the number of countraints 2 x 10179
or to be exact :
267925490760634893755546189948219873995788690377687
078048465194329577247030862734015632117088075939986
913459296483643418942533445648036828825541887362427
99920969079258554704177287
Grotschel
32
AZG
2013
INTERACTION THEORY
33
AZG
2013
INTERACTION THEORY
In 1965 Anang Z. Gani [28] did research on the Facilities Planning
problem as a special project (Georgia Tach in 1965)
Supervision James Apple
Later, J. M. Devis and K. M. Klein further continued the original
work of Anang Z. Gani
Then M. P. Deisenroth PLANET direction of James Apple
(Georgia Tech in1971)
Since 1966, Anang Z. Gani has been continuing his research and
further developed a new concept which is called The Interaction
Theory (INSTITUT TEKNOLOGI BANDUNG)
The model is the From - To chart the which provides quantitative
information of the movement between departments
34
AZG
2013
The model is the From - To chart the which

provides quantitative information of the
movement between departments (common
mileage chart on the road map).
The absolute value or the number of a

element as an individual of a matrix can not
be used in priority setting
the TSP matrix has two values,
1. the initial absolute value (interaction
value)
2. the relative value (interaction coefficient)
DIM = The Delta Interaction Matrix
35
AZG
2013
BAHWA SETIAP ELEMEN ATAU UNSUR MEMILIKI SPESIALISASI

UNTUK DAPAT BERKEMBANG & TUMBUH
INTERAKSI TIDAK HANYA TERJADI DUA ELEMEN
INTERAKSI TIDAK HANYA DALAM BENTUK; AKSI REAKSI, JARAK,

KEUANGAN, BIAYA,FREKUENSI, KOMUNIKASI & KAITAN KIMIA
DAN FISIKA
POKOK PIKIRAN
TEORI INTERAKSI
PERSOALAN YANG DIHADAPI NILAI ABSOLUT

ANGKA ABSOLUT INTERAKSI
INTERAKSI KOMBINASI (COMBINED EFFORT)

INTERAKSI KOMBINASI INI DAPAT DIUNGKAPKAN DALAM
BENTUK KOEFISIEN INTERKASI
KOEFISIEN INTERAKSI MERUPAKAN NILAI RELATIF DARI
COMBINED EFFORT
DENGAN MELUPAKAN NILAI ABSOLUT DAN

MENGGUNAKAN KOEFISIEN INTERAKSI
37
AZG
2013
Two parallel lines

38
AZG
2013
Two parallel lines distorted

(Hering illusion)
39
AZG
2013
700
10
20
800
15
10
10
30
RELATIVE VALUE
44
AZG
2013
The formula for the interaction

coefficient ( ci,j ) is:
ci,j = xi,j2/(Xi. .X.j).

m
= xij
Xi.
(i = 1 . m )
j 1
X.j
xij
(j = 1 . n )
i 1
45
AZG
2013
TSP
TSP
INTERACTION
THEORY
GENERAL
P=NP
AZG
2013
APPLICATION OF THEORY INTERACTION
Traveling Salesman Problem (Symmetric and

Asymmetric, minimum and maximum).
Transportation Problem.
Logistic.
Assignment problem.
Network problem
Set Covering Problem.
Minimum Spanning Tree (MST)
Decision Making.
Layout Problem.
Location Problem
Financial Analysis.
Clustering.
Data Mining
AZG
2013
THE FORMULATION AND THE ALGORITHM

Formulation of the TSP with Interaction
Theory is very simple.
The main activity of the exsisting
algoritms of TSP is searching to find
the optimal solution from so many
alternatives.
The selection is related to the priority.
48
AZG
2013
Preparation phase
The algorithm is
divided into two
general phases:
Processing phase
49
AZG
2013
1. Preparation phase
consists of main 5
steps:
o Defining distance between cities or the

interaction matrix (IMAT)
o Normalization of IMAT (NIMAT)
o Calculating the interaction coefficient
matrix (ICOM)
o Sorting the interaction coefficient as the
sorted ICOM (SICOM)
o Prioritizing the interaction between
cities using the delta interaction matrix
(DIM)
50
AZG
2013
51
AZG
2013
2. Normalization of IMAT (NIMAT)

Normalization of IMAT is necessary to
normalize the matrix elements with each
element is added in front of the numbers
with the numbers 1 + zero is taken from
the digits of the largest element
52
AZG
2013
3. The Interaction coefficient

matrix (ICOM)
The interaction coefficient represents the
relative value of interaction between
elements to other elements
The formula of the
interaction coefficient is:
ci,j = xi,j2/(Xi. .X.j)
53
AZG
2013
3. The Interaction Coefficient Matrix (ICOM)
54
AZG
2013
*
*
c(ij) < c(ij + 1)

c(i1) = minj cij
j = 1, .,n-1
i = 1, .,m
Note of the element: The top value is the original ICOM column number
The bottom value is the sorted interaction coefficient
55
AZG
2013
Note of the element: The top value is the original the DIM column number
The bottom value is the sorted incremental value
56
AZG
2013
2. Processing phase
Processing phase is searching process is
to choose the shortest path.
The searching process is to choose the
shortest path. The searching is related
to the priority
Guide line to use the DIM for
determining the optimal solution (8
Columns)
57
AZG
2013
COMPUTATIONAL
EXPERIENCES AND
EXAMPLE
58
AZG
2013
EXAMPLE ASYMETRIC TSP

1. THE INTERACTION MATRIX (IMAT) 7X7
59
AZG
2013
2. Normalization of IMAT (NIMAT) 7X7
109002
= 20.843
75848 x 75153
60
AZG
2013
3. The Interaction Coefficient

Matrix (ICOM) 7X7
1
1 21.145 20.843 19.016 20.769 20.283

2 20.094
21.411 20.481 19.193
3 20.435 19.144
21.075 20.790
20.753 20.449 20.290
21.337 20.081 20.840 21.095 20.007
4 20.169 20.962 20.499 21.461 19.082 20.506 19.799

5 21.000
19.197 20.586 20.188
21.377 20.395
19.233
6 19.099 20.734 20.838 20.386 20.051 21.232 20.823
7 21.214 20.324 20.079 20.394 21.158 18.584
21.387
61
AZG
2013
4. The Sorted ICOM (SICOM) 7X7

1
2
3
4
5
6
7
3
19.016
4
19.193
2
19.144
5
19.082
2
19.197
1
19.099
6
18.584
5
20.283
1
20.094
7
20.007
7
19.799
7
19.233
5
20.051
3
20.079
4
20.769
7
20.290
4
20.081
1
20.169
4
20.188
4
20.386
2
20.324
7
20.790
6
20.449
1
20.435
3
20.499
6
20.395
2
20.734
4
20.394
2
20.843
3
20.481
5
20.840
6
20.506
3
20.586
7
20.823
5
21.158
6
21.075
5
20.753
6
21.095
2
20.962
1
21.000
3
20.838
1
21.214
1
21.145
2
21.411
3
21.337
4
21.461
5
21.377
6
21.232
7
21.387
62
AZG
2013
5. The Delta Interaction

Matrix (DIM) 7X7
1
2
3
4
5
6
7
3
0
4
0
2
0
5
0
2
0
1
0
6
0
5
1.267
1
901
7
863
7
717
7
36
5
952
3
1.495
4
1.753
7
1.097
4
937
1
1.087
4
991
4
1.287
2
1.740
7
1.774
6
1.256
1
1.291
3
1.417
6
1.198
2
1.635
4
1.810
2
1.827
3
1.288
5
1.696
6
1.424
3
1.389
7
1.724
5
2.574
SOLUTION : 1-3-2-4-5-7-6-1 (2758)
6
2.059
5
1.560
6
1.951
2
1.880
1
1.803
3
1.739
1
2.630
1
2.129
2
2.218
3
2.193
4
2.379
5
2.180
6
2.133
7
2.803
63
MATRIK BAYS29 -JARAK
MATRIK BAYS29 - KOEFISIEN
509
1201152
1188622
1188630
1188632
1188622
1188616
1188640
1188616
1188623
1188622
1201154
1188619
1188626
1188618
1188623
1188644
1188630
1188622
1188630
1188619
1201137
1188647
1188620
1188631
1188657
1188639
1188624
1188632
1188626
1188647
1201154
1188633
1188636
1188629
1188631
1188636
1188622
1188618
1188620
1188633
1201150
1188613
1188649
1188631
1188609
1188616
1188623
1188631
1188636
1188613
1201149
1188648
1188623
1188612
46
1188640
1188644
1188657
1188629
1188649
1188648
1201139
1188629
1188652
72
1188616
1188630
1188639
1188631
1188631
1188623
1188629
1201150
1188630
1188623
1188622
1188624
1188636
1188609
1188612
1188652
1188630
1201146
107
241
190
124
80
316
76
152
107
148
137
88
127
336
183
134
241
148
374
171
259
509
317
217
190
137
374
202
234
222
192
248
124
88
171
202
61
392
202
80
127
259
234
61
386
141
316
336
509
222
392
386
233
438
76
183
317
192
202
141
233
213
10
1188629
1188622
1188630
1188615
1188628
1188629
1188634
1188632
1188632
11
1188640
1188637
1188658
1188620
1188643
1188647
1188623
1188637
1188647
12
1188620
1188626
1188634
1188640
1188616
1188609
1188651
1188626
1188611
13
1188623
1188622
1188636
1188620
1188628
1188627
1188632
1188625
1188632
14
1188642
1188635
1188646
1188619
1188644
1188645
1188630
1188642
1188648
15
1188636
1188630
1188651
1188613
1188636
1188640
1188627
1188636
1188640
152
134
217
248
46
72
438
213
10
157
95
232
42
160
167
254
188
206
11
283
254
491
117
319
351
202
272
365
12
133
180
312
287
112
55
439
193
89
13
113
101
280
79
163
157
235
131
209
16
1188624
1188631
1188644
1188624
1188636
1188635
1188625
1188619
1188640
14
297
234
391
107
322
331
254
302
368
17
1188646
1188636
1188648
1188622
1188641
1188646
1188635
1188645
1188644
15
228
175
412
38
240
272
210
233
286
18
1188640
1188631
1188643
1188617
1188641
1188641
1188632
1188641
1188644
278
19
1188632
1188632
1188645
1188618
1188637
1188636
1188621
1188629
1188641
360
20
1188627
1188618
1188626
1188618
1188627
1188628
1188637
1188635
1188631
21
1188617
1188615
1188624
1188627
1188616
1188618
1188642
1188626
1188620
22
1188645
1188638
1188649
1188622
1188647
1188648
1188633
1188645
1188651
23
1188627
1188638
1188648
1188634
1188640
1188633
1188618
1188616
1188641
16
17
129
348
176
265
349
422
121
152
232
314
226
362
187
313
98
344
18
276
199
356
86
287
296
266
289
333
19
188
182
355
68
238
232
154
177
284
20
150
67
204
70
155
164
282
216
201
124 > 113

1188622 < 1188623
64
AZG
2013
Soal 150
65
AZG
2013
Soal 150
66
AZG
2013
Computational experiences
Breakthrough for a TSP algorithm
The process of finding a solution :
Requires only max 20 columns (DIM)
a huge saving in time and storage space
101 cities instance generate 31 solutions

657 cities instance gives 4 solutions
Monalisa Instance (100.000 cities), 7 solutions
67
68
Final Leader Board : The winner of the USA TSP Challenge (115.475)
1.
Length ;Team ;Date
2.
6204999 ;Xavier Clarist ;27.8.2012
3.
6204999 ;Keld Helsgaun ;17.9.2012
4.
6204999 ;Yuichi Nagata ;1.2.2013
5.
6205000 ;Vladimir Shylo ;4.2.2013
6.
6205001 ;Xavier Clarist ;6.8.2012
7.
6205005 ;Keld Helsgaun ;1.8.2012
8.
6205015 ;Ivan Gradinar ;11.4.2013
9.
6205017 ;Vladimir Shylo ;25.1.2013
10. 6205028 ;Xavier Clarist ;30.7.2012

11. 6205064 ;Keld Helsgaun ;16.7.2012
12. 6205118 ;Roman Bazylevych, Bohdan Kuz, Roman Kutelmakh ;3.7.2013
13. 6205251 ;Mohammad Syarwani ;3.7.2013
15. 6205320 ;Ashley Wang ;4.11.2012
17. 6211995 ;Geir Hasle, Torkel Haufmann, Christian Schulz ;4.7.2013

18. 6221125 ;Marco Alves Ganhoto ;3.7.2013
19. 6251141 ;Wenhong Tian ;3.7.2013
20. 6424026 ;David Liu ;2.7.2013

21. 6598272 ;Cyrille Yemeli Tasse ;4.3.2013
AZG
2013
Transportation
Problems
Graph
Decision
Making
Location
Problems
Clustering
TSP
Scheduling
(Symmetric & Asymmetric

Layout
Problems
Routing
Financial
Analysis
Assignment
Problems
Network Problems
Data Mining
70
AZG
2013
Operations Research
Transportasi
Computer Science
Industri
Telekomunikasi
Militer
Ekonomi
Distribusi / Logistik
Kimia
Strategi
Sosial
Fisika
Finansial
Psikologi
Biologi
71
AZG
2013
90
80
64
65
66
70
63
49
32
90
71
11
36
20
19
10
62
60
35
30
51
70
34
47
81
48
50
88
82
31
33
69
50
46
8
40
45
84
99
85
16
93
94
59
98
91
96
53
92
37
26
54
58
55
40
21
97
73
87
42
44
24
80
13
95
100
10
12
101
61
86
29
68
89
79
28
17
20
77
27
83
60
30
76
52
18
78
4
72
74
22
57
25
56
39
75
14
38
43
23
41
15
67
0
0
10
20
30
40
50
60
70
80
Route for 101 cities ( 31 Optimal solutions)

72
AZG
2013
Portrait of Mona Lisa with Solution of a Traveling

Salesman Problem. Courtesy of Robert Bosch 2012
( 7 Optimal solutions)
73
AZG
2013
CONCLUSION
The conclusion is that the

Interaction Theory creates a new
paradigm to the new efficient and
effective algorithm for solving the
TSP easily (P=NP).
Overall, the Interaction Theory
shows a new concept which has
potential for development in
mathematics, computer science
and Operations Research and their
applications
74
AZG
2013
Four Mathematician Are Hired By The USA Government

To Solve The Most Powerful Problem In Computer
Science History
75
AZG
2013
THANK
YOU
76
AZG
2013
1.
2.
3.
4.
5.
6.
7.
8.
REFERENCES
Aarts, E.H.L., Korst, J.H.M., and Laarhoven, P.J.M., (1988) "A
Quantitative Analysis of the Simulated Annealing Algorithm: A Case Study
for the Traveling Salesman Problem", J. Stats. Phys. 50, 189-206
Apple, J.M., & Deisenroth, M.P., A Computerized Plant Layout Analysis
and Evalualion Technique (PLANFI). Proceedings, American Instilute of
Industrial Engineers, 23 rd Annual Conferencee and Convention.
Anaheim. Calif. 1972.
Applegate, D.L., Bixby, R.E., Chvtal, V., and Cook, W., (1998) ) "On the
solution of traveling salesman problems" Documenta Mathematica - Extra
Volume, ICM III 645-658.
Applegate, D. L., Bixby, R.E., Chvtal, V., Cook, W., 2006. The Traveling
Salesman Problem. Princeton University Press
Balaprakash, P., & Montes De Oca, M. A., (Eds.). (2006, November 06).
Ant Colony Optimization. Retrieved March 24, 2007.
Balas, E., & Guignard, M., (1979). Branch and bound/Implicit
enumeration. Ann. Discrete Math. 5, 185-191.
Bellman, R., (1962). Dynamic programming treatment of the traveling
salesman problem. Journal of the ACM (JACM), 9, 61-63. Retrieved
March 9, 2007.
Bellmore, M., & Malone, J.C., (1971). Pathology of Travelling Salesman
Sublourelimination Algorithms. Oper. Res. 19, 278-307, 1766.
77
AZG
2013
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
Bland, R.G., Goldfarb, D., Tood, MJ., (1981). The ellipsoid method: a survoy.
Oper. Res. 29. 29, 1039-1091.
Bureard, R.E., (1979). "Traveling Salesman and Assignment Problems: A
survey, "Annals of Discrete Mathematies, 4, 193-215.
Carpaneto, G., Totlf, P., (1980). Some new branching and bounding criteria for
the asymmetric travelling salesman problem. Management Sci. 26, 736-743.
Christofides, N., & Ellon, S., (1972). Algoritms for large-scale Traveling
Salesman Problems. Oper. Res. Quart. 23, 511-518.
Christofides, N., & Mingozzi, A., Toth, P., (1980). Exact algoritms for tbs
vehicle routing problem based on spanning tree and shorted patlx relaxations.
Malh. Programming 20, 255-282.
Chvtal, V., (1983). Linear Programming, Freeman. San Fransisco.
Clarke, G., and Wright, J., Scheduling of vehicles from a central depot to a
number of delivery points, Operations Research, 12 (1964) 568-581.
Cook, S A., (1971). "The Complexity of theorem Proving Procedures," Proc.
3rd ACM Symp. on theTheory of Computing, ACM, 151-158.
Cook, W.J., (2012). In Pursuit of the Traveling Salesman. Princeton
University Press.
Crowes, G.A.,(1958) , A method for solving traveling salesman problems.
Op.Res., 6, 1958, pp.791-812.
78
AZG
2013
19. Dantzig, G., Fulkerson, R., & Johnson, S., (1959). On a linearprogramming, combinatorial approach to the traveling-salesman problem.
Operations Research, 7, 58. Retrieved March 8, 2007.
20. Dantzig, G., Fulkerson, R., & Johnson, S., (1954). "Solution of a Largescale Traveling Salesman Problem," Operations Research2, 393-410.
21. Devlin, K. (2002). The Millenium Problems, The Seven Greatest Unsolved
Mathematical Puzzles of Our Time. Granta Books.
22. Dorigo, M., & Stutzle, T., (2004). Ant colony optimization. Cambridge,
MA: MIT Press.
23. Crowder, H., and Padberg, M. W., (1980). Solving large scale symmetric
traveling salesman problems to optimality. In Management Science,
26:495-509
24. Fiechter, C.N., (1990) "A Parallel Tabu Search Algorithm for Large Scale
Traveling Salesman Problems" Working Paper 90/1 Department of
Mathematics, Ecole Polytechnique Federale de Lausanne, Switzerland.
25. Fisher, M.L., (1988). "Lagrangian Optimization Algorithms for Vehicle
Routing Problems," Operational Research '87, G.K. Rand, ed., 635-649.
26. Flood, M. M., (1956). The traveling-salesman problem. Operations
Research, 4, 61. Retrieved March 8, 2007.
27. Fredman, M.L., Johnson, D.S., McGeogh, L.A., and Ostheimer, G., (1995).
Data structures for traveling salesmen. J.Algorithms, Vol.18, pp.432-479
79
AZG
2013
28. Gani, A.Z., (1965). Evaluation of Alternative Materials Flow Handling
Pattern. Special Project. Georgia Institute of Technology.
29. Gani, A.Z., (1987). The Application of the Interaction Theory for Solving the
Traveling Salesman Problem (TSP). Presented at the ORSA / TIMS Joint
National Meeting St. Louis, MO.
30. Garfinkel, R.S., and Neuhauser, G.L., 1972. Integer Programming. Wiley, New
York.
31. Glover, F., (1989). Tabu Search - Part I. ORSA Journal on Computing, 1, 190-206.
Retrieved December 15, 2006.
32. Grtschel, M., Padberg, M.W., (1979) On the symmetric traveling
salesman problem I: inequalities. Math. Program.16, 255-280
33. Gutin, G., and Yeo, A., (2007). The Greedy Algorithm for the Symmetric
TSP.Algorithmic Oper. Res., Vol.2, 2007, pp.3336.
34. Held, M.,& Karp, R.M., The traveling-salesman problem and minimum spanning
trees. Op.Res., 18, 1970, pp.1138-1162.
35. Helsgaun, K.,( 2009) General k-opt submoves for the Lin-Kernighan TSP
heuristic. Mathematical Programming Computation,.
36. Hopfield,J.J., and Tank, D., (1985) Neural computations of decisions in
optimization problems. Biological Cybernetics, 52:141-152,
37. Johnson, D.S.,& McGeoch, L.A., (1997) The Traveling Salesman Problem: A
Case Study in Local Optimization. In Aarts, E. H. L.; Lenstra, J. K., Local Search
in Combinatorial Optimisation, John Wiley and Sons Ltd, pp. 215V310,.
80
AZG
2013
38. Junger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.,
Reinelt, G.,
Rinaldi, G., Wolsey, L., (2010). 50 Years of Integer
Programming 1958-2008: From the Early Years to the State.Springer.
39. Khachian, L.G., (1972). A polynomial algorithm in linier programming (in
Russian). Dokl. Akad. Nauk SSSR 244, 1093-1096. Translation. Sovict Math.
Dolcl. 20, 191-194 (1979).
40. Karg, R. L., & Thompson, G. L., (1964). A heuristic approach to solving
traveling salesman problems. Management Science, 10, 225.
41. Karmarkar, N., (1984). A New polynomial-time algorithm for linier
programming. Combinalorica 4,373-395.
42. Karp, R., and Steele, J.M., (1985). "Probabilistic Analysis of Heuristics," in
The Traveling Salesman Problem, Lawler, Lenstra, Rinnooy Kan and
Shmoys, eds., John Wiley, 181-205.
43. Karp, R. M.,(1972). "Reducibility among combinatorial problems,"
in Complexity of Computer Computations: Proceedings of a Symposium on
the Complexity of Computer Computations, R. E. Miller and J. W. Thatcher,
Eds., The IBM Research Symposia Series, New York, NY: Plenum Press, pp.
85-103.
44. Kirkpatrick, S., Gelatt, C.D., and Vecchi, M.P., (1983),. Optimization by
Simulated Annealing. Science, 220 1983, pp.671-680.
45. Lin, S.,& Kernighan, B.W., An Effective Heuristic Algorithm for the TravelingSalesman Problem. Op.Res., 21, 1973, pp.498-516.
81
AZG
2013
46. Little, J. D., Murty, K. G., Sweeney, D. W., & Karel, C., (1963). An algorithm
for the traveling salesman problem. Operations Research, 11, 972.
47. Miller, C. E., Tucker, A. W., & Zemlin, R. A., (1960 ) Integer programming
formulation of traveling salesman problems. Journal ofManagement
Science,.
48. Miller, D., and Pekny, J., (1991). "Exact Solution of Large Asymmetric
Traveling Salesman Problems," Science251, 754-761.
49. Nagata, Y., and Kobayashi, S., (1997) Edge assembly crossover : A highpower genetic algorithm for the traveling salesman problem. In Proc. of
ICGA97, page 450-457. Morgan Kaufmann,
50. Padberg, M.W., and Rinaldi, G., (1991). "A Branch and Cut Algorithm for the
Resolution of Large-scale Symmetric Traveling Salesmen Problems," SIAM
Review33, 60-100.
51. Papadimitriou, C.H., Steiglitz, K.,[1982]. Combinatorial Optimization
Algorithm and complexity, Prentice-Hall, Englewood Cliffs, NJ.
52. Potvin, J.V. (1996) "Genetic Algorithms for the Traveling Salesman
Problem", Annals of Operations Research 63, 339-370.
53. Rego, C., Gamboa, D., Glover, F., Osteman, C., (2011) Traveling Salesman
problem heuristic : leading methods, implementations and latest advances,
European Journal of Operational Research 427-441.
82
54. Reinelt, G. (1994). The Traveling Salesman: Computational Solutions for

TSP Applications Springer-Verlag, Berlin.
55. Reinelt, G. (1991) "TSPLIB - A traveling salesman library", ORSA Journal
on Computing 3 376-384.
56. Concorde. http://www.tsp.gatech.edu/
57. Georgia Tech website on TSP.
58. Wikipedia entry on TSP.
AZG
2013
83

00 Interaction Edisi MGB 11-Dec-2013

Diunggah oleh

Informasi Dokumen

Judul Asli

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

00 Interaction Edisi MGB 11-Dec-2013

Diunggah oleh

Hak Cipta:

Format Tersedia

MAJELIS GURU BESAR

INSTITUT TEKNOLOGI BANDUNG

Anang Zaini Gani

Mengembangkan suatu metode untuk : TSP

(Keywords: Graph; P vs NP; Combinatorial Optimization;

The area of Applications :

The problem of TSP is to find the shortest

The TSP very simple and easily stated but it is

the alternative routes exponentially increases

ALTERNATIVE RUTE 32!/2 =

KOMPUTER PALING TOP $ 133.000.000 ROADRUNNER

DIPERLUKAN WAKTU 28 TRILIUN TAHUN

INI MEMANG GILA

1. The Birch and SwinnertonDyer Conjecture

150 cities = 5.7134x10262

The shortest traveling salesman route going through all 13,509

THIS IS CHALLENGE TO PROVE

The class of problem :

until now no-one has been able to prove whether

TSP dealing with the resources :

SUMMARIZES THE MILESTONES OF SOLVING

G. Dantzig, R. Fulkerson, and S.

M. Held and R.M. Karp

P.M. Camerini, L. Fratta, and F.

H. Crowder and M.W. Padberg

M. Padberg and G. Rinaldi

M. Grtschel and O. Holland

M. Padberg and G. Rinaldi

SUMMARIZES THE MILESTONES OF SOLVING

D. Applegate, R. Bixby, V. Chvtal,

D. Applegate, R. Bixby, V. Chvtal,

D. Applegate, R. Bixby, V. Chvtal,

D. Applegate, R. Bixby, V. Chvtal,

TECHNIQUE AND METHOD

d(i,j) = (direct) distance between

Each city must be exited exactly once

Subtour elimination constraint

x(i, j) S 1, S {1, 2,...,n}

NUMBER OF LINIER INEQUALITIES

If n=15 the number of countraints is

If n=50 the number of countraints 1060

The model is the From - To chart the which

The absolute value or the number of a

BAHWA SETIAP ELEMEN ATAU UNSUR MEMILIKI SPESIALISASI

INTERAKSI TIDAK HANYA DALAM BENTUK; AKSI REAKSI, JARAK,

PERSOALAN YANG DIHADAPI NILAI ABSOLUT

INTERAKSI KOMBINASI (COMBINED EFFORT)

DENGAN MELUPAKAN NILAI ABSOLUT DAN

Two parallel lines

Two parallel lines distorted

The formula for the interaction

ci,j = xi,j2/(Xi. .X.j).

APPLICATION OF THEORY INTERACTION

Traveling Salesman Problem (Symmetric and

THE FORMULATION AND THE ALGORITHM

o Defining distance between cities or the

2. Normalization of IMAT (NIMAT)

3. The Interaction coefficient

ci,j = xi,j2/(Xi. .X.j)

3. The Interaction Coefficient Matrix (ICOM)

c(ij) < c(ij + 1)

EXAMPLE ASYMETRIC TSP

2. Normalization of IMAT (NIMAT) 7X7