A truck must deliver furniture to stores located in five different cities A, B, C, D,...

 

Transcribed Image Text:

A truck must deliver furniture to stores located in five different cities A, B, C, D, and E. The truck must start and end its route at A. The time (in hours) for travel between the cities is shown in the figure. Find an optimal tour for this TSP and give its cost in hours. (Hint: The edge AD is part of an optimal tour.) An optimal tour is given by the Hamilton circuit (Use a comma to separate vertices as needed.) hours. The cost of this optimal tour is (Type a whole number.) 19 35 44 Ea B 19 23 31 20 24 D 27 C 12 A truck must deliver furniture to stores located in five different cities A, B, C, D, and E. The truck must start and end its route at A. The time (in hours) for travel between the cities is shown in the figure. Find an optimal tour for this TSP and give its cost in hours. (Hint: The edge AD is part of an optimal tour.) An optimal tour is given by the Hamilton circuit (Use a comma to separate vertices as needed.) hours. The cost of this optimal tour is (Type a whole number.) 19 35 44 Ea B 19 23 31 20 24 D 27 C 12