The Omaha company delivers its product to 7 customers. The distances (in miles) among the customers...

 

Transcribed Image Text:

The Omaha company delivers its product to 7 customers. The distances (in miles) among the customers are shown in the table and the driver would like to find the shortest route that takes her from 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. (Choose A as the starting point). The total minimal distance is ________ (miles) From/To ABCDEFGH A B с D E F G H 0 288 231 210 89 216 118 264 62 0 51 166 211 36 223 270 176 196 0 126 90 235 190 83 210 216 86 0 171 223 93 242 160 0 238 104 139 193 44 73 79 255 275 241 116 46 276 125 271 31 137 0 50 196 41 293 0 164 33 79 52 107 225 0 The Omaha company delivers its product to 7 customers. The distances (in miles) among the customers are shown in the table and the driver would like to find the shortest route that takes her from 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. (Choose A as the starting point). The total minimal distance is ________ (miles) From/To ABCDEFGH A B с D E F G H 0 288 231 210 89 216 118 264 62 0 51 166 211 36 223 270 176 196 0 126 90 235 190 83 210 216 86 0 171 223 93 242 160 0 238 104 139 193 44 73 79 255 275 241 116 46 276 125 271 31 137 0 50 196 41 293 0 164 33 79 52 107 225 0

Answer rating: 100% (QA)

The nearest neighbor heuristic is a greedy algorithm that starts at a city and then visits the neare... View the full answer