New Results on the Old k-opt Algorithm for the Traveling Salesman Problem

Local search with k-change neighborhoods is perhaps the oldest and most widely used heuristic method for the traveling salesman problem, yet almost no theoretical performance guarantees for it were previously known. This paper develops several results, some worst-case and some probabilistic, on the performance of 2- and k-opt local search for the traveling salesman problem, with respect to both the quality of the solution and the speed with which it is obtained.

[1]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[2]  Lov K. Grover.  Local search and the local structure of NP-complete problems , 1992, Oper. Res. Lett..

[3]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[4]  Walter Kern,et al.  A probabilistic analysis of the switching algorithm for the euclidean TSP , 1989, Math. Program..

[5]  Noga Alon,et al.  On-line steiner trees in the Euclidean plane , 1992, SCG '92.

[6]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[7]  Giri Narasimhan,et al.  New sparseness results on graph spanners , 1995, Int. J. Comput. Geom. Appl..

[8]  Mark W. Krentel,et al.  Structure in locally optimal solutions , 1989, 30th Annual Symposium on Foundations of Computer Science.

[9]  Tunc Geveci,et al.  Advanced Calculus , 2014, Nature.

[10]  C. A. Rogers.  Covering a sphere with spheres , 1963 .