Journal of Heuristics

, Volume 11, Issue 2, pp 135–146 | Cite as

A Note on Single Alternating Cycle Neighborhoods for the TSP

Article

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.

Keywords

TSP edge-exchange neighborhoods Lin-Kernighan ejection chains local search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aarts, E. and J. Lenstra. (1997). Local Search in Combinatorial Aptimization. Wiley, Chichester.Google Scholar
  2. 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.Google Scholar
  3. Applegate, D., W. Cook, and A. Rohe. (2003b). “Chained Lin-Kernighan for Large Traveling Salesman Problems.” INFORMS Journal on Computing 15(1), 82–92.Google Scholar
  4. Bentley, J. (1992). “Fast Algorithms for Geometric Traveling Salesman Problems.” Operations Research Society of America 4(4), 387–411.Google Scholar
  5. Fredman, M., D. Johnson, L. McGeoch, and G. Ostheimer. (1995). “Data Structures for Traveling Salesman.” Journal of Algorithms 18, 432–479.Google Scholar
  6. 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.Google Scholar
  7. 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.Google Scholar
  8. Glover, F. (1996). “Ejection Chains, Reference Structures and Alternating Path Structures for Traveling Salesman Problems.” Discrete Applied Mathematics 65, 223–253.Google Scholar
  9. Gutin, G. and A. Punnen (eds.). (2002). The Traveling Salesman Problem and Its Variations, volume 12 of Combinatorial Optimization. Kluwer, Dordrecht.Google Scholar
  10. 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.Google Scholar
  11. 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.Google Scholar
  12. 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.Google Scholar
  13. Lin, S. and B. Kernighan. (1973). “An Effective Heuristic Algorithm for the Traveling-Salesman Problem.” Operations Research 21, 498–516.Google Scholar
  14. 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.Google Scholar
  15. 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.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.GTS Systems and Consulting GmbHHerzogenrathGermany
  2. 2.Deutsche Post Lehrstuhl für Optimierung von DistributionsnetzwerkenRWTH Aachen UniversityTemplergraben 64AachenGermany

Personalised recommendations