
Starting with 2 farthest cities
Find distance from each city not yet in the tour to all cities in the tour
MHT had the longest distance to the tour; finding the place to insert it (thin lines represent the segment to remove; medium lines indicate the segments that replace it)
increase=194.50+134.28-226.61=102.18
increase=134.28+194.50-226.61=102.18
Adding MHT to tour at point that minimizes increase in distance
Find distance from each city not yet in the tour to all cities in the tour
HVN had the longest distance to the tour; finding the place to insert it (thin lines represent the segment to remove; medium lines indicate the segments that replace it)
increase=181.55+220.84-194.50=207.89
increase=220.84+132.08-134.28=218.63
increase=132.08+181.55-226.61=87.02
Adding HVN to tour at point that minimizes increase in distance
Find distance from each city not yet in the tour to all cities in the tour
BDL had the longest distance to the tour; finding the place to insert it (thin lines represent the segment to remove; medium lines indicate the segments that replace it)
increase=128.81+150.72-194.50=85.03
increase=150.72+106.96-134.28=123.40
increase=106.96+76.90-132.08=51.78
increase=76.90+128.81-181.55=24.15
Adding BDL to tour at point that minimizes increase in distance
Find distance from each city not yet in the tour to all cities in the tour
ORH had the longest distance to the tour; finding the place to insert it (thin lines represent the segment to remove; medium lines indicate the segments that replace it)
increase=167.13+82.27-194.50=54.90
increase=82.27+70.82-134.28=18.80
increase=70.82+139.61-132.08=78.35
increase=139.61+76.11-76.90=138.82
increase=76.11+167.13-128.81=114.43
Adding ORH to tour at point that minimizes increase in distance
Tour produced by -insert farthest
-insert farthest : 685.37 ALB MHT ORH PVD HVN BDL ALB