Skip to main content
SpringerLink
Log in

Heuristic and Metaheuristic Algorithms for the Traveling Salesman Problem

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Introduction

Heuristics for the Traveling Salesman Problem

Metaheuristics for the Traveling Salesman Problem

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aarts E, Korst J (1989) Simulated Annealing and Boltzmann Machines - A stochastic Approach to Combinatorial Optimization and Neural Computing. John Wiley and Sons, Chichester

    MATH  Google Scholar 

  2. Aarts E, Ten Eikelder HMM (2002) Simulated Annealing. In: Pardalos PM, Resende MGC (eds) Handbook of Applied Optimization. Oxford University Press, Oxford, pp 209–221

    Google Scholar 

  3. Aarts E, Korst J, Van Laarhoven P (1997) Simulated Annealing. In: Aarts E, Lenstra JK (eds) Local Search in Combinatorial Optimization. John Wiley and Sons, Chichester, pp 91–120

    Google Scholar 

  4. Ansari N, Hou E (1997) Computational Intelligence for Optimization, 1st edn. Kluwer, Boston

    MATH  Google Scholar 

  5. Applegate D, Cook W, Rohe A (2003) Chained Lin-Kernighan for Large Traveling Salesman Problems. Informs J Comput 15:82–92

    Article  MathSciNet  Google Scholar 

  6. Bai Y, Zhang W, Jin Z (2006) An New Self-Organizing Maps Strategy for Solving the Traveling Salesman Problem. Chaos Solitons Fractals 28(4):1082–1089

    Article  MATH  MathSciNet  Google Scholar 

  7. Balas E, Fischetti M (2002) Polyhedral Theory for the Assymetric Traveling Salesman Problem. In: Gutin G, Punnen A (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 117–168

    Google Scholar 

  8. Balas E, Toth P (1985) Branch and Bound Methods. In: Lawer EL, Lenstra JK, Rinnoy Kan AHG, Shmoys DB (eds) The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley and Sons, Chichester, pp 361–401

    Google Scholar 

  9. Baralia R, Hildago JI, Perego R (2001) A Hybrid Heuristic for the Traveling Salesman Problem. IEEE Trans Evol Comput 5(6):1–41

    Google Scholar 

  10. Beardwood J, Halton JH, Hammersley JM (1959) The Shortest Path Through Many Points. Proc Cambridge Philos Soc 55:299–327

    MATH  MathSciNet  Google Scholar 

  11. Bentley JL (1992) Fast Algorithms for Geometric Traveling Salesman Problems. ORSA J Comput 4:387–411

    MATH  MathSciNet  Google Scholar 

  12. Bodin L, Golden B, Assad A, Ball M (1983) The State of the Art in the Routing and Scheduling of Vehicles and Crews. Comput Oper Res 10:63–212

    Article  MathSciNet  Google Scholar 

  13. Charon I, Hudry O (1993) The Noising Method: A New Combinatorial Optimization Method. Oper Res Lett 14:133–137

    Article  MATH  MathSciNet  Google Scholar 

  14. Charon I, Hudry O (2000) Applications of the Noising Method to the Traveling Salesman Problem. Eur J Oper Res 125:266–277

    Article  MATH  MathSciNet  Google Scholar 

  15. Chen Y, and Zhang P (2006) Optimized Annealing of Traveling Salesman Problem from the nth-Nearest-Neighbor Distribution. Physica A: Stat Theor Phys 371(2):627–632

    Article  Google Scholar 

  16. Chu SC, Roddick JF, Pan JS (2004) Ant Colony System with Communication Strategies. Inf Sci 167(1–4):63–76

    Article  MATH  MathSciNet  Google Scholar 

  17. Clarke G, and Wright J (1964) Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Oper Res 12:568–581

    Google Scholar 

  18. Dorigo M, Gambardella LM (1997) Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans Evol Comput 1(1):53–66

    Article  Google Scholar 

  19. Dorigo M, Stutzle T (2004) Ant Colony Optimization, A Bradford Book. The MIT Press Cambridge, Massachusetts, London

    Google Scholar 

  20. Gamboa D, Rego C, Glover F (2005) Data Structures and Ejection Chains for Solving Large-Scale Traveling Salesman Problems. Eur J Oper Res 160(1):154–171

    Article  MATH  Google Scholar 

  21. Gamboa D, Rego C, Glover F (2006) Implementation Analysis of Efficient Heuristic Algorithms for the Traveling Salesman Problem. Comput Oper Res 33(4):1154–1172

    Article  MATH  Google Scholar 

  22. Gendreau M, Hertz A, Laporte G (1992) New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Oper Res 40:1086–1094

    MATH  MathSciNet  Google Scholar 

  23. Glover F (1986) Future Paths for Integer Programming and Links to Artificial Intelligence. Comput Oper Res 13:533–549

    Article  MATH  MathSciNet  Google Scholar 

  24. Glover F (1989) Tabu Search I. ORSA J Comput 1(3):190–206

    MATH  Google Scholar 

  25. Glover F (1990) Tabu Search II. ORSA J Comput 2(1):4–32

    MATH  Google Scholar 

  26. Glover F (1990) Tabu search: A tutorial. Center for Applied Artificial Intelligence, University of Colorado, pp 1–47

    Google Scholar 

  27. Glover F (1992) Ejection Chains, Reference Structures and Alternating Path Algorithms for Traveling Salesman Problem. Discrete Appl Math 65:223–253

    Article  MathSciNet  Google Scholar 

  28. Glover F (1997) A Template for Scatter Search and Path Relinking. Lecture Notes in Computer Science, vol 1363. pp 13–54

    Google Scholar 

  29. Glover F, and Laguna M (2002) Tabu Search. In: Pardalos PM, Resende MGC (eds) Handbook of Applied Optimization. Oxford University Press, Oxford, pp 194–209

    Google Scholar 

  30. Glover F, Laguna M, Marti R (2003) Scatter Search and Path Relinking: Advances and Applications. In: Glover F, Kochenberger GA (eds) Handbook of Metaheuristics. Kluwer, Boston, pp 1–36

    Chapter  Google Scholar 

  31. Glover F, Laguna M, Taillard E, de Werra D (eds) (1993) Tabu Search. J.C. Baltzer AG, Science Publishers, Basel, Switzerland

    Google Scholar 

  32. Goldbarg EFG, Souza GR, Goldbarg MC (2006) Particle Swarm Optimization for the Traveling Salesman Problem. EVOCOP 2006 LNCS 3906:99–110

    Google Scholar 

  33. Golden BL, Stewart WR (1985) Empirical Analysis of Heuristics. In: Lawer EL, Lenstra JK, Rinnoy Kan AHG, Shmoys DB (eds) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley and Sons, Chichester, pp 207–249

    Google Scholar 

  34. Gutin G, Punnen A (eds) (2002) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht

    MATH  Google Scholar 

  35. Haimovich M, Rinnoy Kan AHG, Stougie L (1988) Analysis of Heuristics for Vehicle Routing Problems. In: Golden BL, Assad AA (eds) Vehicle Routing: Methods and Studies. Elsevier Science Publishers, North Holland, pp 47–61

    Google Scholar 

  36. Hansen P, Mladenovic N (2001) Variable Neighborhood Search: Principles and Applications. Eur J Oper Res 130:449–467

    Article  MATH  MathSciNet  Google Scholar 

  37. Helsgaun K (2000) An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic. Eur J Oper Res 126:106–130

    Article  MATH  MathSciNet  Google Scholar 

  38. Holland J H. (1975) Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor

    Google Scholar 

  39. Johnson DS, McGeoch LA (1997) The Traveling Salesman Problem: A Case Study. In: Aarts E, Lenstra JK (eds) Local Search in Combinatorial Optimization. John Wiley and Sons, Chichester, pp 215–310

    Google Scholar 

  40. Johnson DS, McGeoch LA (2002) Experimental Analysis of the STSP. In: Gutin G, Punnen A (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 369–444

    Google Scholar 

  41. Johnson DS, Papadimitriou CH (1985) Computational Complexity. In: Lawer EL, Lenstra JK, Rinnoy Kan AHD, Shmoys DB (eds) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley and Sons, Chichester, pp 37–85

    Google Scholar 

  42. Johnson DS, Papadimitriou CH (1985) Performance Guarantees for Heuristics. In: Lawer EL, Lenstra JK, Rinnoy Kan AHD, Shmoys DB (eds) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley and Sons, Chichester, pp 145–181

    Google Scholar 

  43. Karp RM, Steele JM (1985) Probabilistic Analysis of Heuristics. In: Lawer EL, Lenstra JK, Rinnoy Kan AHD, Shmoys DB (eds) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley and Sons, Chichester, pp 181–206

    Google Scholar 

  44. Kennedy J, Eberhart R (1995) Particle Swarm Optimization. Proc. 1995 IEEE Int Conf Neural Netw 4:1942–1948

    Google Scholar 

  45. Kirkpatrick S, Gelatt CD, Vecchi MP (1982) Optimization by Simulated Annealing. Science 220:671–680

    Article  MathSciNet  Google Scholar 

  46. Lawer EL, Lenstra JK, Rinnoy Kan AHG, Shmoys DB (1985) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley and Sons, New York

    Google Scholar 

  47. Li X, Tian P, Hua J, Zhong N (2006) A Hybrid Discrete Particle Swarm Optimization for the Traveling Salesman Problem. SEAL 2006, LNCS 4247:181–188

    Google Scholar 

  48. Lin S (1965) Computer Solutions of the Traveling Salesman Problem. Bell Syst Tech J 44:2245–2269

    MATH  Google Scholar 

  49. Lin S, Kernighan BW (1973) An Effective Heuristic Algorithm for the Traveling Salesman Problem. Oper Res 21:498–516

    MATH  MathSciNet  Google Scholar 

  50. Marinakis Y, Migdalas A, Pardalos PM (2005) Expanding Neighborhood GRASP for the Traveling Salesman Problem. Comput Optim Appl 32:231–257

    Article  MATH  MathSciNet  Google Scholar 

  51. Marinakis Y, Migdalas A, Pardalos PM (2005) A Hybrid Genetic-GRASP algortihm Using Langrangean Relaxation for the Traveling Salesman Problem. J Combinat Optim 10:311–326

    Article  MATH  MathSciNet  Google Scholar 

  52. Mladenovic N, Hansen P (1997) Variable Neighborhood Search. Comput Oper Res 24:1097–1100

    Article  MATH  MathSciNet  Google Scholar 

  53. Modares A, Somhom S, Enkawa T (1999) A Self-Organizing Neural Network Approach for Multiple Traveling Salesman and Vehicle Routing Problems. Int Trans Oper Res 6(6):591–606

    Article  MathSciNet  Google Scholar 

  54. Neto DM (1999) Efficient Cluster Compensation for Lin - Kernighan Heuristics. Ph.D. Thesis, Computer Science University of Toronto, Canada

    Google Scholar 

  55. Ninio M, Schneider JJ (2005) Weight Annealing. Physica A: Stat Theor Phys 349(3–4):649–666

    Article  Google Scholar 

  56. Or I (1976) Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking. Ph.D. Thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston IL

    Google Scholar 

  57. Sodererg B, Peterson C (1997) Artificial Neural Networks. In: Aarts E, Lenstra JK (eds) Local Search in Combinatorial Optimization. John Wiley and Sons, Chichester, pp 173–214

    Google Scholar 

  58. Platzmann LK, Bartholdi JJ (1989) Spacefilling Curves and the Planar Traveling Salesman Problem. J Assoc Comput Mach 36:719–735

    MathSciNet  Google Scholar 

  59. Potvin J Y. (1996) Genetic Algorithms for the Traveling Salesman Problem. Metaheuristics Combinatorial Optim Ann Oper Res 63:339–370

    Google Scholar 

  60. Punnen AP (2002) The Traveling Salesman Problem: Applications, Formulations and Variations. In: Gutin G, Punnen A (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 1–28

    Google Scholar 

  61. Reeves CR (1995) Genetic Algorithms. In: Reeves CR (ed) Modern Heuristic Techniques for Combinatorial Problems. McGraw - Hill, London, pp 151–196

    Google Scholar 

  62. Reeves CR (2003) Genetic Algorithms. In: Glover F, Kochenberger GA (eds) Handbooks of Metaheuristics. Kluwer, Dordrecht, pp 55–82

    Chapter  Google Scholar 

  63. Rego C (1998) Relaxed Tours and Path Ejections for the Traveling Salesman Problem. Eur J Oper Res 106:522–538

    Article  MATH  Google Scholar 

  64. Rego C, Glover F (2002) Local Search and Metaheuristics. In: Gutin G, Punnen A (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 309–367

    Google Scholar 

  65. Reinelt G (1994) The Traveling Salesman, Computational Solutions for TSP Applications. Springer, Berlin

    Google Scholar 

  66. Resende MGC, Ribeiro CC (2003) Greedy Randomized Adaptive Search Procedures. In: Glover F, Kochenberger GA (eds) Handbook of Metaheuristics. Kluwer, Boston, pp 219–249

    Chapter  Google Scholar 

  67. Ronald S (1995) Routing and Scheduling Problems. In: Chambers L (ed) Practical Handbook of Genetic Algorithms. CRC Press, New York, pp 367–430

    Google Scholar 

  68. Rosenkratz DJ, Stearns RE, Lewis PM (1977) An Analysis of Several Heuristics for the Travelling Salesman Problem. SIAM J Comput 6:563–581

    Article  MathSciNet  Google Scholar 

  69. Siqueira PH, Teresinha M, Steiner A, Scheer S (2007) A New Approach to Solve the Traveling Salesman Problem. Neurocomputing 70(4–6):1013–1021

    Google Scholar 

  70. Taillard ED (2002) Ant Systems. In: Pardalos PM, Resende MGC (eds) Handbook of Applied Optimization. Oxford University Press, Oxford, pp 130–138

    Google Scholar 

  71. Voudouris C, Tsang E (1999) Guided Local Search and its Application to the Travelling Salesman Problem. Eur J Oper Res 113:469–499

    Article  MATH  Google Scholar 

  72. Voudouris C, Tsang E (2003) Guided Local Search. In: Glover F, Kochenberger GA (eds) Handbooks of Metaheuristics. Kluwer, Dordrecht, pp 185–218

    Chapter  Google Scholar 

  73. Wang Y, Feng XY, Huang YX, Pu DB, Zhou WG, Liang YC, Zhou CG (2007) A Novel Quantum Swarm Evolutionary Algorithm and its Applications. Neurocomputing 70 (4–6):633–640

    Google Scholar 

  74. Zachariasen M, Dam M (1996) Tabu Search on the Geometric Traveling Salesman Problem. In: Osman IH, Kelly JP (eds) Meta-heuristics: Theory and Applications. Kluwer, Boston, pp 571–587

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Production Engineering and Management, Decision Support Systems Laboratory, Technical University of Crete, Chania, Greece

    Yannis Marinakis

Authors
  1. Yannis Marinakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Marinakis, Y. (2008). Heuristic and Metaheuristic Algorithms for the Traveling Salesman Problem . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_262

Download citation

Publish with us

Policies and ethics

Search

Navigation