Question 19
TSP
The distance matrix for 6 cities and corresponding edge costs (in sorted order) are provided below. Use this information to construct TSP tours.
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | - | 66 | 32 | 18 | 73 | 40 |
| B | 66 | - | 92 | 14 | 81 | 60 |
| C | 32 | 92 | - | 26 | 16 | 52 |
| D | 18 | 14 | 26 | - | 68 | 80 |
| E | 73 | 81 | 16 | 68 | - | 84 |
| F | 40 | 60 | 52 | 80 | 84 | - |
| BD | CE | AD | CD | AC |
|---|---|---|---|---|
| 14 | 16 | 18 | 26 | 32 |
| AF | CF | BF | AB | DE |
|---|---|---|---|---|
| 40 | 52 | 60 | 66 | 68 |
| AE | DF | BE | EF | BC |
|---|---|---|---|---|
| 73 | 80 | 81 | 84 | 92 |
Based on the above data, answer the given subquestions.
Construct a tour using Greedy Heuristic. Enter the path representation of the tour starting from city E.
Enter a comma separated list of city names.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
Answer format: E,X,Y,Z