Traveling-Salesman Problem

 

1

 

2

 

4

 

3

 

Distance matrix

 

Analysis:

 

1

 

2

 

3

 

4

 

Now, we have some links (cities have

 

already been visited) and some

 

1

 

\

 

40

 

55

 

28

 

unvisited cities. We must

 

(1) choose a city from those

 

2

 

40

 

\

 

16

 

7

 

unvisited cities,

 

3

 

55

 

16

 

\

 

66

 

(2) insert the city between one of

 

4

 

28

 

7

 

66

 

\

 

the exist links.