Traveling-Salesman Problem

 

1

 

2

 

4

 

3

 

Distance matrix

 

1

 

2

 

3

 

4

 

1

 

\

 

40

 

55

 

28

 

Analysis:

 

We have found a solution using

 

2

 

40

 

\

 

16

 

7

 

heuristic algorithm.

 

3

 

55

 

16

 

\

 

66

 

The total distance in this case is

 

55+ 16 + 7 +28 = 106

 

4

 

28

 

7

 

66

 

\