Question: 2. This distances between 6 cities A, B. C, D. E and F are as follows: (a) Calculate the 1-tree lower bound for the TSP

2. This distances between 6 cities A, B. C, D. E
2. This distances between 6 cities A, B. C, D. E and F are as follows: (a) Calculate the 1-tree lower bound for the TSP on the corre- sponding graph. take A as point 1. (b) The method of 2-changes is a way of exploring a neighbour- hood of an existing solution to try to come up with a better one. In the TSP, a 2-change neighbourhood of a tour g is defined as Na(g) = {f : f is also a tour and can be obtained from g by removing two edges from g and replacing them with two other edges.} Use the method of 2-changes to find a feasible (not necessarily optimal) solution to this TSP. Start with the path A - B - C - D-E-F-A. (c) Compare the complexity of this type of problem in general with that of the method you used and explain the difference. (d) Use (a) to evaluate the accuracy of the answer in (b)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!