Traveling-Salesman Problem

 

1

 

 

2

 

4

 

3

 

Distance matrix

 

1

 

2

 

3

 

4

 

1

 

\

 

40

 

55

 

28

 

Step 1:

 

2

 

40

 

\

 

16

 

7

 

choose a city that is nearest

 

3

 

55

 

16

 

\

 

66

 

from the starting city

 

4

 

28

 

7

 

66

 

\