Traveling-Salesman Problem

 

1

 

2

 

4

 

3

 

Distance matrix

 

Step 2:

 

1

 

2

 

3

 

4

 

consider each unvisited cities,

 

1

 

\

 

40

 

55

 

28

 

and each exist links, choose the

 

unvisited city and exist link that have

 

2

 

40

 

\

 

16

 

7

 

the smallest H value

 

3

 

55

 

16

 

\

 

66

 

In this case: H(1, 4, 2) =19

 

H(1, 4, 3) = 93

 

4

 

28

 

7

 

66

 

\

 

So we insert 2 between (1, 4)