Nonoblivious 2-Opt heuristics for the traveling salesman problem

The k-opt heuristics are among the most common techniques for approaching the traveling salesman problem (TSP). They are used either directly or as subroutines in more sophisticated heuristics, such as the celebrated Lin–Kernighan heuristic. The value of k is typically 2 or 3. In this article, we modify the 2-opt heuristic to be based on a function f of the distances rather than the distances solely. This may be viewed as modifying the local search with the 2-change neighborhood to be nonoblivious. We denote the corresponding heuristic by (2, f)-opt. We provide theoretical performance guarantees for it: both lower and upper bounds based on the ones given by Chandra et al. [SIAM J Comput 28 (1999), 1998–2029], obtained originally for the standard 2-opt heuristic. By a tighter analysis of the neighborhood size, we improve their upper bound for the standard 2-opt by a factor of , and we show that these bounds hold for (2, f)-opt for any nonnegative, increasing function f. We then provide experimental evidence based on TSPLIB benchmark problems, showing that (2, f)-opt with for various values of significantly outperforms 2-opt. These values of r also depend on the method chosen for constructing the initial tours. Specifically, when the initial tours are random permutations, the improvement over 2-opt is more than 35% for ; when they are generated by the Nearest Neighbor heuristic, it is about 10% for r = 0.5, 0.55, 0.6. We also see that the average length of the tour generated by (2, f)-opt is relatively close to the optimum or the known bound. © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 62(3), 201–219 2013

[1]  Ola Svensson,et al.  Approximating Graphic TSP by Matchings , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[2]  Emile H. L. Aarts,et al.  Theoretical aspects of local search , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

[3]  Shen Lin Computer solutions of the traveling salesman problem , 1965 .

[4]  Abraham P. Punnen,et al.  Approximate local search in combinatorial optimization , 2004, SODA '04.

[5]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[6]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[7]  Mohit Singh,et al.  A Randomized Rounding Approach to the Traveling Salesman Problem , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[8]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[9]  Howard J. Karloff,et al.  New results on the old k-opt algorithm for the TSP , 1994, SODA '94.

[10]  Craig A. Tovey,et al.  New Results on the Old k-opt Algorithm for the Traveling Salesman Problem , 1999, SIAM J. Comput..

[11]  Paola Alimonti New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems , 1994, CIAC.

[12]  Rajeev Motwani,et al.  On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[13]  George C. Runger,et al.  See the forest before the trees: fine-tuned learning and its application to the traveling salesman problem , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[14]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[15]  G. Croes A Method for Solving Traveling-Salesman Problems , 1958 .

[16]  David P. Williamson,et al.  The Design of Approximation Algorithms: Random Sampling and Randomized Rounding of Linear Programs , 2011 .

[17]  Nicos Christofides Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[18]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[19]  David S. Johnson,et al.  8. The traveling salesman problem: a case study , 2003 .

[20]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[21]  Eric Angel,et al.  A Survey of Approximation Results for Local Search Algorithms , 2006, Efficient Approximation and Online Algorithms.

[22]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[23]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[24]  Marcin Mucha 13/9-approximation for Graphic TSP , 2012, STACS.

[25]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.