The Alphabet Soup Company is delivering the monthly supply of their fine product to their seven customers

The distances in miles between the customers are shown in the table and, wishing to be as efficient as possible, the driver would like to find the shortest route that takes her from the starting point A to every customer and then back to the starting point. Use the nearest neighbor heuristic to identify a route that would minimize the distance traveled.

From/To A B C D E F G H
A 0 288 231 210 89 216 118 264
B 62 0 51 166 211 36 223 270
C 176 196 0 126 90 235 190 83
D 210 216 86 0 171 46 276 125
E 223 93 242 160 0 238 104 139
F 193 44 73 79 137 0 50 196
G 255 275 241 116 41 293 0 164
H 271 31 33 79 52 107 225 0

Starting at site A, the closest site is E at 89 miles. The next legs of the journey are:
Site E to site B = 93 miles
Site B to site F = 36 miles
Site F to site G = 50 miles
Site G to site D = 116 miles
Site D to site C = 86 miles
Site C to site H = 83 miles
Site H to site A = 271 miles
The total distance driven is 824 miles.