Abstract
This paper investigates two different local search approaches for the TSP. Both approaches are based on the general concept of single-alternating cycle neighborhoods. The first approach, stems from the famous heuristic suggested by Lin and Kernighan and the second is based on the notion of stem-and-cycles developed by Glover in the early nineties. We show that the corresponding neighborhoods are not identical and that only a subset of moves can be found when Lin & Kernighan’s gain criterion is applied.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Aarts, E. and J. Lenstra. (1997). Local Search in Combinatorial Aptimization. Wiley, Chichester.
Applegate, D., R. Bixby, V. Chvatal, and W. Cook. (2003a). “Implementing the Dantzig-Fulkerson-Johnson Algorithm for Large Traveling Salesman Problems.” Mathematical Programming, Series B 97(1–2), 91–153.
Applegate, D., W. Cook, and A. Rohe. (2003b). “Chained Lin-Kernighan for Large Traveling Salesman Problems.” INFORMS Journal on Computing 15(1), 82–92.
Bentley, J. (1992). “Fast Algorithms for Geometric Traveling Salesman Problems.” Operations Research Society of America 4(4), 387–411.
Fredman, M., D. Johnson, L. McGeoch, and G. Ostheimer. (1995). “Data Structures for Traveling Salesman.” Journal of Algorithms 18, 432–479.
Glover, F. (1991). “Multilevel Tabu Search and Embedded Search Neighborhoods for the Travling Salesman Problem.” Technical report, US West Chair in Systems Science, University of Colorado, Boulder, School of Business, Campus Box 419, Boulder, CO, 80309.
Glover, F. (1992). “New Ejection Chain and Alternating Path Methods for Traveling Salesman Problems.” In O. Balci, R. Sharda, and S. Zenios (eds.), Computer Science and Operations Research—New Developments in Their Interfaces. Pergamon Press, pp. 491–508.
Glover, F. (1996). “Ejection Chains, Reference Structures and Alternating Path Structures for Traveling Salesman Problems.” Discrete Applied Mathematics 65, 223–253.
Gutin, G. and A. Punnen (eds.). (2002). The Traveling Salesman Problem and Its Variations, volume 12 of Combinatorial Optimization. Kluwer, Dordrecht.
Johnson, D. and L. McGeoch. (1997). “The Traveling Salesman Problem: A Case Study in Local Optimization.” In E. Aarts and J. Lenstra (eds.), Local Search in Combinatorial Optimization, chapter 8. Wiley, Chichester, pp. 215–310.
Johnson, D. and L. McGeoch. (2002). “Experimental Analysis of Heuristics for the stsp.” In G. Gutin and A. Punnen (eds.), The Traveling Salesman Problem and Its Variations, volume 12 of Combinatorial Optimization. Kluwer, Dordrecht.
Lawler, E., J. Lenstra, A. Rinnooy Kan, and D. Shmoys. (eds.). (1985). The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics. Wiley, Chichester.
Lin, S. and B. Kernighan. (1973). “An Effective Heuristic Algorithm for the Traveling-Salesman Problem.” Operations Research 21, 498–516.
Or, I. (1976). “Traveling Salesman-Type Problems and their Relation to the Logistics of Regional Blood Banking.” PhD thesis, Department of Industrial Engineering and Management Sciences. Northwestern University, Evanston, IL.
Rego, C. and F. Glover. (2002). “Local Search and Metaheuristics.” In G. Gutin and A. Punnen (eds.), The Traveling Salesman Problem and Its Variations, volume 12 of Combinatorial Optimization, chapter 8. Kluwer, Dordrecht, pp. 309–368.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Funke, B., Grünert, T. & Irnich, S. A Note on Single Alternating Cycle Neighborhoods for the TSP. J Heuristics 11, 135–146 (2005). https://doi.org/10.1007/s10732-005-0713-6
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10732-005-0713-6