INTERACTION THEORY

NEW PARADIGM FOR SOLVING THE

TRAVELING SALESMAN PROBLEM
(TSP)

Anang Z.Gani
Department of Industrial Engineering
Institut Teknologi Bandung
Bandung, Indonesia 2012
ganiaz@gmail.com
ganiaz@mail.ti.itb.ac.id

AZG
2012

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).
2

AZG
2012

INTRODUCTION

AZG
2012

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
4

AZG
2012

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?)

AZG
2012

4
123-4

1233-1

1324-1

AZG
2012

AZG
2012

AZG
2012

AZG
2012

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 WAKTUN 28 TRILIUN TAHUN

SEDANGKAN UMUR UNIVERS HANYA 14
MILIAR TAHUN

INI MEMANG GILA

AZG
2012

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

11

AZG
2012

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

12

AZG
2012

OBJECTIVE

13

AZG
2012

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
2012

. "The P versus NP
Problem" is considered one
of the seven greatest
unsolved mathematical
problems

15

AZG
2012

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
NP-complete problem, then there are
polynomial algorithms for all NP-complete
problems.

THIS IS CHALLENGE TO PROVE

P= NP MUST BE PURSUED!

16

AZG
2012

BACKGROUND

17

AZG
2012 HAMILTON (1800)
MENGER (1920)
LINEAR
PROGREMING
1. EXACT SOLUTIONS
LP, IP, BB , C.P, DP,
ELIPSOIND &
PROJECTIVE
SCALING.
2. HEURISTIC
CONSTRUCTIVE
IMPROEV METHOD
METAHEURISTICS
BIOPLOGICAL
BEHAVIOR
3. COMPUTER
TECHNOLOGY

1. STEPHEN COOK (1971)

COMPUTATIONAL
COMPLEXITY THEORY
NP COMPLETENESS
2. RICHAR M. KARP (1972)
TSP = NP COMPLETE
PROBLEM

P VS NP
P = NP OR P NP
NEW PARADIGM

INTERACTION THEORY (P = NP)

18

AZG
2012

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).
19

AZG
2012

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)
20

AZG
2012

PARADIGM
OLD
1. LP & VARIANTS
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)
21

AZG
2012

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

22

AZG
2012

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

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

W. Cook and K. Helsgaun

24,978 cities

2006

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

and W. Cook

85,900 cities

2009

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

and W. Cook

1,904,711 cities

2009

Yuichi Nagata

100.000
Mona Lisa

23

AZG
2012

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
24

AZG
2012

OBJECTIVE FUNCTION
n

z x(i, j)d(i, j)
i1 j 1

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

city i and city j.

25

Constraints

AZG
2012
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
2012

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

27

AZG
2008

>> Min 1000X111+ 93X121+ 82X131+ 44X141+ 68X151+ 93X211+ 1000X221+ 150X231+
137X241+ 62X251+ 82X311+ 150X321+ 1000X331+ 38X341+ 99X351+ 44X411+ 137X421+
38X431+ 1000X441+ 88X451+ 68X511+ 62X521+ 99X531+ 88X541+1000X551+ 1000X112+
93X122+ 82X132+ 44X142+ 68X152+ 93X212+ 1000X222+ 150X232+ 137X242+ 62X252+
82X312+ 150X322+ 1000X332+ 38X342+ 99X352+ 44X412+ 137X422+ 38X432+ 1000X442+
88X452+ 68X512+ 62X522+ 99X532+ 88X542+ 1000X552+ 1000X113+ 93X123+ 82X133+
44X143+ 68X153+ 93X213+ 1000X223+ 150X233+ 137X243+ 62X253+ 82X313+ 150X323+
1000X333+ 38X343+ 99X353+ 44X413+ 137X423+ 38X433+ 1000X443+ 88X453+ 68X5134
62X523+ 99X533+ 88X543 + 1000X554+ 1000X114+ 93X124+ 82X134+ 44X144+ 68X154+
93X214+ 1000X224+ 150X234+ 137X244+ 62X254+ 82X314+ 150X324+ 1000X334+ 38X344+
99X354+ 44X414+ 137X424+ 38X434+ I000X444+ 88X454+ 68X514+ 62X524+ 99X534+
88X544+ 1000X554+ I000X115+ 93X125+ 82X135+ 44X145+ 68X155+ 93X215+ 1000X225+
150X235+ 137X245+ 62X255+ 82X315+ 150X325+ 1000X335+38X345+ 99X355+ 44X415+
137X425+ 38X435+ 1000X445+ 88X455+68X515+62X525+99X535+88X545+1000X555

28

AZG
2008

>>Subjed to
>>(1)1X121+1X131+1X141+1X151=1
>>(2)1X215+1X315+1X415+1X515=1
>>(3)1X232+1X242+1X252+1X322+1X342+1X352+1X422+1X432+1X452+1X522+1X532+1X542=1
>>(4)1X233+1X243+1X253+1X323+1X343+1X353+1X423+1X433+1X453+1X523+1X533+1X543=1
>>(5)1X234+1X244+1X254+1X324+1X344+1X354+1X424+1X434+1X454+1X524+1X534+1X544=1
>>(6)1X251+1X232+1X242+1X223+1X233+1X243+1X224+1X234+1X244+1X215=1
>>(7)1X351+1X322+1X342+1X323+1X343+1X324+1X344+1X315=1
>>(8)1X451+1X422+1X432+1X423+1X433-1X424+1X415=1
>>(9)1X522+1X532+1X542+1X523+1X533+1X543+1X524+1X534+1X544+1X515=1
>>(10)1X121+1X322+1X422+1X522+1X223+1X323+1X423+1X523+1X224+1X324+1X424+1X524=1
>>(11)1X131+1X232+1X332+1X432+1X532+1X233+1X433+1X533+1X224+1X324+1X424+1X524= 1
>>(12)1X141+1X242+1X342+1X542+1X243+1X343+1X543+1X244+1X344+1X544=1
>>(13)1X151+1X252+1X352+1X452+1X253+1X353+1X453+1X254+1X354+1X454=1
>>(14)1X121-1X232-1X242-1X252+1X322=0
>>(15)1X131-lX322- lX342-1X352=0
>>(16)1X141-1X422-1X432-1X452=0
>>(17)1X151-1X522-1X532-1X542=0
>>(18)1X322+1X422+1X522-1X233-1X243-1X253=0
>>(19)1X232+1X332+1X432+1X532-1X323-1X343-1X353=0
>>(20)1X242+1X342+1X542-1X423-1X433-1X453=0
>>(21)1X252+1X352+1X452-1X523-1X533-1X543=0
>>(22)1X323+1X423+1X523-1X234-1X244-1X254=0
>>(23)1X233+1X433+1X533- lX324- lX344- lX354=0
>>(24)1X243+1X343+1X543+1X424+1X434+1X454=0
>>(25)1X253+1X353+1X453-1X524-1X534-1X544=0
>>(26)1X324+1X424+1X524-1X215=0
>>(27)1X234+1X434+1X534-1X315=0
>>(28)1X244+1X344+1X544-1X415=0
>>(29)1X254+1X354+1X454-1X515=0
>>(29)1X254+1X354+1X454-1X515=0

29

AZG
2012

INTERACTION THEORY

30

AZG
2012

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
31

AZG
2012

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
32

AZG
2012

Two parallel lines

33

AZG
2012

Two parallel lines distorted

(Hering illusion)

34

AZG
2012

700

10

20

800

15

10

10

30

RELATIVE VALUE
35

AZG
2012

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

36

AZG
2012

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.

37

AZG
2012

Preparation phase
The algorithm is
divided into two
general phases:
Processing phase

38

AZG
2012

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)
39

AZG
2012

To
From

Total

x11

x1j

xin

Xi.

xii

x1j

xin

Xi.

xm1

Total

xmn
X.j

Xi..

40

AZG
2012

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

41

AZG
2012

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)

42

AZG
2012

3. The Interaction Coefficient Matrix (ICOM)

To
1

From
1

c11

cij

cin

ci1

cij

cin

cm1

cmj

cmn

43

AZG
2012

*
*

SICOM
1

c(ij) < c(ij + 1)

c(i1) = minj cij

j = 1, .,n-1
i = 1, .,m

..

c(1,2)

c(1,5)

c(1,3)

10

11

c(k,10)

c(k,4)

c(k,11)

17

c(m,3)

c(m,17)

c(m,2)

..

..
k
..
m

Note of the element: The top value is the original ICOM column number
The bottom value is the sorted interaction coefficient
44

AZG
2012

DIM
1

1
2

2
5

..

l
3

..

d(1,2)= c(1,2)c(1,2)=0

d(1,5)= c(1,5)c(1,2)

d(1,3)= c(1,3)c(1,2)

10

11

d(k,10)= c(k,10)c(k,10)=0

d(k,4)= c(k,4)c(k,10)

d(k,11)= c(k,11)c(k,10)

17

d(m,3)= c(m,3)c(m,3)=0

d(m,17)= c(m,17)c(m,3)

d(m,2)= c(m,2)c(m,3)

..
k

..
m

Note of the element: The top value is the original the DIM column number
The bottom value is the sorted incremental value
45

AZG
2012

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)
46

AZG
2012

COMPUTATIONAL
EXPERIENCES AND
EXAMPLE

47

AZG
2012

EXAMPLE ASYMETRIC TSP

1. THE INTERACTION MATRIX (IMAT) 7X7
1

Total

900

420

876

788

988

876

4848

677

767

410

865

777

698

4194

777

411

658

898

956

633

4333

689

876

764

411

784

560

4084

888

390

768

650

736

390

3822

427

843

879

747

698

856

4450

987

733

677

747

987

289

4420

Total

4445

4153

4275

4088

4647

4530

4013

30151

48

AZG
2012

2. Normalization of IMAT (NIMAT) 7X7

1

Total

11000

10900

10420

10876

10788

10988

10876

75848

10677

11000

10767

10410

10865

10777

10698

75194

10777

10411

11000

10658

10898

10956

10633

75333

10689

10876

10764

11000

10411

10784

10560

75084

10888

10390

10768

10650

11000

10736

10390

74822

10427

10843

10879

10747

10698

11000

10856

75450

10987

10733

10677

10747

10987

10289

11000

75420

Total

75445

75153

75275

75088

75647

75530

75013

527151

109002
= 20.843
76848 x 75445

49

AZG
2012

3. The Interaction Coefficient

Matrix (ICOM) 7X7
1

21.145 20.843 19.016 20.769 20.283 21.075 20.790

20.094 21.411 20.481 19.193 20.753 20.449 20.290

20.435 19.144 21.337 20.081 20.840 21.095 20.007

20.169 20.962 20.499 21.461 19.082 20.506 19.799

21.000 19.197 20.586 20.188 21.377 20.395 19.233

19.099 20.734 20.838 20.386 20.051 21.232 20.823

21.214 20.324 20.079 20.394 21.158 18.584 21.387

50

AZG
2012

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
51

AZG
2012

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

52

AZG
2012

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 8 solutions

657 cities instance gives 4 solutions

Monalisa Instance (100.000 cities), 7 solutions

53

AZG
2012

TSP
TSP

INTERACTION
THEORY

GENERAL

P=NP

AZG
2012

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
2012

THE AREA OF APPLICATIONS OF TSP ARE AS

FOLLOWS :

Road Trips
Mapping Genomes
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
Customized Computer Chip

57

AZG
2012

Transportation
Problems

Graph

Decision
Making

Location
Problems
Clustering

TSP
Scheduling

(Symmetric & Asymmetric

Layout
Problems

Routing

Financial
Analysis

Assignment
Problems
Network Problems

Data Mining

58

AZG
2012

Operations Research

Transportasi

Computer Science

Industri

Telekomunikasi

Militer

Ekonomi

Distribusi / Logistik

Kimia

Strategi

Sosial

Fisika

Finansial

Psikologi

Biologi

59

AZG
90
2012
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 ( 8 Optimal solutions)

60

AZG
2012

Route for 657 cities ( 4 Optimal Solutions)

61

AZG
2012

Portrait of Mona Lisa with Solution of a Traveling

Salesman Problem. Courtesy of Robert Bosch 2012
( 7 Optimal solutions)

62

AZG
2012

CONCLUSION

The conclusion is that the

Interaction Theory creates a new
paradigm to the new efficient and
effective algorithm for solving the
TSP easily (N=NP).
Overall, the Interaction Theory
shows a new concept which has
potential for development in
mathematics, computer science
and Operations Research and their
applications
63

AZG
2012

SIMPLICITY IS
POWER
THANK
YOU
64