Consider the following instance of the Travelling Salesman Problem: A В 22 18 12 6 10 E 23 11 26 17 D Highlighted in bold is the following route of length 62: A → C → B → E → D → A Apply the 2-opt...

Travelling Salesman Problem

Extracted text: Consider the following instance of the Travelling Salesman Problem: A В 22 18 12 6 10 E 23 11 26 17 D Highlighted in bold is the following route of length 62: A → C → B → E → D → A 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 А. 1 В. 2 С. 3 D. 4 E. 5 or more