QAM-III, 2019 Section G

Course Instructor: Sonia

Assignment Sheet

Solve 6-city Traveling Salesman Problem using the branch and bound algorithm discussed in the class. Learn
the ‘Nearest Neighbor Heuristic’ by yourself and solve your TSP using this heuristic as well. To create your cost
matrix, take 30 data points (out of the given 58 data points) starting from the serial number corresponding to
your roll number from the list given below. Feed these entries row-wise in your 6 × 6 matrix, the iith cost entry
remains M .

S.No. Cost S.No. Cost

1 9 35 4
2 10 36 8
3 10 37 10
4 5 38 6
5 11 39 1
6 8 40 9
7 7 41 10
8 8 42 2
9 3 43 9
10 11 44 10
11 13 45 12
12 10 46 7
13 13 47 11
14 1 48 10
15 14 49 5
16 3 50 7
17 10 51 12
18 9 52 3
19 9 53 3
20 11 54 6
21 12 55 12
22 3 56 4
23 2 57 11
24 4 58 1
25 8
26 10
27 8
28 14
29 8
30 8
31 14
32 14
33 6
34 3

Instructions
• Please submit the following:
1. Neat and clean Branch and Bound tree and the optimal solution with complete details.
2. Feed the cost matrix of your problem in an excel file and submit the same.
3. Best Nearest Neighbor solution along with all 6 TSP solutions obtained successively.
4. Comparison between the optimal solution and the heuristic solution.
• Submissions without the input data file (in excel) shall not be evaluated.
• If you get the optimal solution of your TSP at the root node itself, then you MUST change your cost
matrix to the symmetric matrix and then solve the problem again.