Question: Traveling Salesman Problem. a) Plot the delivery locations; b) using rectilinear distance, plot the optimum order to visit each delivery location; c) using Euclidean distance,
Traveling Salesman Problem. a) Plot the delivery locations; b) using rectilinear distance, plot the optimum order to visit each delivery location; c) using Euclidean distance, plot the optimum order to visit each delivery location; and d) your truck can only carry sufficient goods to visit 5 delivery locations per trip, group the delivery locations into 3 (optimized) groups of 5 and plot the optimum order to visit delivery locations in each group.
| Delivery Locations | |
| X | Y |
| 5 | 0 |
| 13 | 6 |
| 3 | 5 |
| 4 | 10 |
| 0 | 8 |
| 19 | 20 |
| 12 | 14 |
| 7 | 15 |
| 4 | 7 |
| 8 | 15 |
| 12 | 4 |
| 5 | 3 |
| 11 | 18 |
| 9 | 0 |
| 20 | 4 |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
