Abstract
A move of the 3-OPT neighborhood for the Traveling Salesman Problem consists in removing any three edges of the tour and replacing them with three new ones. The standard algorithm to find the best possibble move is cubic, both in its worst and average time complexity. Since TSP instances of interest can have thousands of nodes, up to now it has been impossible to use the 3-OPT local search on anything other than quite small instances. In this paper we describe an alternative algorithm whose average complexity appears to be quadratic and which allowed us to use 3-OPT on instances with several thousand nodes. The algorithm is based on a rule for quickly choosing two out of three edges in a good way, and then completing the choice in linear time. To this end, the algorithm uses max-heaps as a suitable data structure.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Aarts, E., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization, 1st edn. Wiley, Inc., New York, NY, USA (1997)
Applegate, D.L., Bixby, R.E., Chvatl, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press (2006)
Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791–812 (1958)
de Berg, M., Buchin, K., Jansen, B., Woeginger, G.J.: Fine-grained complexity analysis of two classic TSP variants. In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, 11–15 July 2016, Rome, Italy, pp. 5:1–5:14 (2016)
Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44(10), 2245–2269 (1965)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity, vol. 01. Prentice Hall (1982)
Reinelt, G.: TSPLIB—a traveling salesman problem library. ORSA J. Comput. 3, 376–384 (1991)
Steiglitz, K., Weiner, P.: Some improved algorithms for computer solution of the traveling salesman problem. In: Proceedings of the 6th annual Allerton Conference on System and System Theory, pp. 814–821. University of Illinois, Urbana (1968)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Lancia, G., Dalpasso, M. (2018). Speeding-up the Exploration of the \(3\)-OPT Neighborhood for the TSP. In: Daniele, P., Scrimali, L. (eds) New Trends in Emerging Complex Real Life Problems. AIRO Springer Series, vol 1. Springer, Cham. https://doi.org/10.1007/978-3-030-00473-6_37
Download citation
DOI: https://doi.org/10.1007/978-3-030-00473-6_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00472-9
Online ISBN: 978-3-030-00473-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)