Question: Could you solve this TSP. Using 2-opt algorithm. Consider the following instance of the Travelling Salesman Problem: B 22 8 12 6 10 E 23
Consider the following instance of the Travelling Salesman Problem: B 22 8 12 6 10 E 23 11 26 17 D Highlighted in bold is the following route of length 62: A+ C + B + E + DA Apply the 2-opt algorithm until you reach a local minimum. How many applications of the 2-opt swap rule are required until you reach a local minimum. Select ONE correct answer A. 1 B. 2 C. 3 D. 4 E. 5 or more
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
