article

A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem

INFORMS Journal on Computing, Volume 8, Issue 2

Pages 134 - 143

https://doi.org/10.1287/ijoc.8.2.134

Published: 01 May 1996 Publication History

Abstract

<P>This article describes a new composite heuristic for the symmetric Traveling Salesman Problem. The heuristic consists of three phases: construction of an initial envelope, insertion of the remaining vertices, and improvement procedure. The heuristic is shown to perform very well both on randomly generated instances and on TSPLIB problems.</P>

References

[1]

J.J. BENTLEY, 1992. Fast Algorithms for Geometric Traveling Salesman Problems, ORSA Journal on Computing 4, 387-411.

[2]

C.-N. FIECHTER, 1990. A Parallel Tabu Search Algorithm for Large Scale Traveling Salesman Problems, Working Paper 90/1, Département de Mathématiques, École Polytechnique Fédérale de Lausanne.

[3]

M. GENDREAU, A. HERTZ, and G. LAPORTE, 1992. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem, Operations Research 40, 1086-1094.

Digital Library

[4]

B.L. GOLDEN and C.C. SKISCIM, 1986. Using Simulated Annealing to Solve Routing and Location Problems, Naval Research Logistics Quarterly 33, 261-280.

[5]

B.L. GOLDEN and W.R. STEWART JR., 1985. Empirical Analysis of Heuristic, in The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E.W. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (eds.), Wiley, Chichester, 207-249.

[6]

M. GROTSCHEL and O. HOLLAND, 1991. Solution of Large-scale Symmetric Traveling Salesman Problems, Mathematical Programming 51, 141-202.

Digital Library

[7]

D.S. JOHNSON, 1990. Local Optimization and the Traveling Salesman Problem, in Proceedings of the 17th International Colloquium on Automatic Languages and Programming, E.M. Paterson (ed.), Lecture Notes in Computer Science. Springer-Verlag, Berlin, 446-461.

[8]

J. KNOX, 1994. Tabu Search Performance on the Symmetric Traveling Salesman Problem, Computers & Operations Research 21, 867-876.

Digital Library

[9]

G. LAPORTE, 1992. The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms, European Journal of Operation Research 59, 231-247.

[10]

E.L. LAWLER, J.K. LENSTRA, A.H.G. RINNOOY KAN, D.B. SHMOYS (eds.), 1985. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, Chichester.

[11]

S. LIN, 1965. Computer Solutions of the Traveling Salesman Problem, Bell System Computer Journal 44, 2245-2269.

[12]

S. LIN and B.W. KERNIGHAN, 1973. An Effective Heuristic Algorithm for the Traveling Salesman Problem, Operations Research 21, 498-516.

Digital Library

[13]

K.-T. MAK and A.J. MORTON, 1993. A Modified Lin-Kernighan Traveling Salesman Heuristic, Operations Research Letters 13, 127-132.

Digital Library

[14]

S. NAHAR, S. SAHNI, and E. SHRAGOWITZ, 1989. Simulated Annealing and Combinatorial Optimization, International Journal of Computer Aided VLSI Design 1, 1-23.

[15]

J. NORBACK and R. LOVE, 1977. Geometric Approaches to Solving the Traveling Salesman Problem, Management Science 23, 1208-1223.

Digital Library

[16]

H.L. ONG and H.C. HUANG, 1989. Asymptotic Expected Performance of Some TSP Heuristics, European Journal of Operational Research 43, 231-238.

[17]

I. OR, 1976. Traveling Salesman-type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking, Ph.D. Dissertation, Northwestern University, Evanston, IL.

[18]

I.H. OSMAN, 1993. Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem, Annals of Operations Research 41, 421-451.

Digital Library

[19]

M.W. PADBERG and G. RINALDI, 1991. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems, SIAM Review 33, 60-100.

Digital Library

[20]

G. REINELT, 1991. TSPLIB--A Traveling Salesman Problem Library, ORSA Journal on Computing 3, 376-384.

[21]

G. REINELT, 1992. Fast Heuristics for Large Scale Geometric Traveling Salesman Problem. ORSA Journal on Computing 4, 206-217.

[22]

D.J. ROSENKRANTZ, R.E. STEARNS, and P.M. LEWIS II, 1977. An Analysis of Several Heuristics for the Traveling Salesman Problem, SIAM Journal on Computing 6, 563-581.

Digital Library

[23]

Y. ROSSIER, M. TROYON, and T.M. LIEBLING, 1986. Probabilistic Exchange Algorithms and the Euclidean Traveling Salesman Problem, Operations Research Spektrum 8, 151-164.

[24]

K. STEIGLITZ and P. WEINER, 1968. Some Improved Algorithms for Computer Solution of the Traveling Salesman Problem, in Proceedings of the 6th Annual Allerton Conference on Circuit Theory, R.T. Chien and T.N. Trick (eds.), New York, 814-821.

[25]

R. SEDGEWICK, 1988. Algorithms, Addison-Wesley, Reading, MA.

[26]

W.R. STEWART JR., 1987. Accelerated Branch Exchange Heuristics for Symmetric Traveling Salesman Problems, Networks 17, 423-437.

Digital Library

[27]

W.R. STEWART JR., 1977. A Computationally Efficient Heuristic for the Traveling Salesman Problem, in Proceedings of the 13th Annual Meeting of S.E. TIMS, 75-85.

Cited By

Niranjani GUmamaheswari K(2022)Minimization of Sustainable-Cost Using Tabu Search for Single Depot Heterogeneous Vehicle Routing Problem with Time WindowsWireless Personal Communications: An International Journal10.1007/s11277-022-09802-y126:2(1481-1514)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1007/s11277-022-09802-y
Ardalan ZKarimi SPoursabzi ONaderi B(2015)A novel imperialist competitive algorithm for generalized traveling salesman problemsApplied Soft Computing10.1016/j.asoc.2014.08.03326:C(546-555)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1016/j.asoc.2014.08.033
Moazzez-Estanjini RWang JPaschalidis I(2013)Scheduling mobile nodes for cooperative data transport in sensor networksIEEE/ACM Transactions on Networking10.1109/TNET.2012.221689721:3(974-989)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1109/TNET.2012.2216897
Show More Cited By

A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem

Recommendations

A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem

<P>We consider a variant of the classical symmetric Traveling Salesman Problem in which the nodes are partitioned into clusters and the salesman has to visit at least one node for each cluster. This NP-hard problem is known in the literature as the ...
Composite Algorithm Based on Clarke - Wright and Local Search for the Traveling Salesman Problem
ICIBE '19: Proceedings of the 5th International Conference on Industrial and Business Engineering

Traveling Salesman Problem (TSP) is an NP-hard optimization problem that can be solved by a heuristic composite algorithm. A composite algorithm is a heuristic optimization model that combine tour construction algorithm and tour improvement algorithm. ...
A Multilevel Approach to the Travelling Salesman Problem

We motivate, derive, and implement a multilevel approach to the travelling salesman problem. The resulting algorithm progressively coarsens the problem, initialises a tour, and then employs either the Lin-Kernighan LK or the Chained Lin-Kernighan CLK ...

Comments

Information & Contributors

Information

Published In

cover image INFORMS Journal on Computing

INFORMS Journal on Computing Volume 8, Issue 2

May 1996

105 pages

ISSN:1526-5528

Issue’s Table of Contents

Publisher

INFORMS

Linthicum, MD, United States

Publication History

Published: 01 May 1996

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Niranjani GUmamaheswari K(2022)Minimization of Sustainable-Cost Using Tabu Search for Single Depot Heterogeneous Vehicle Routing Problem with Time WindowsWireless Personal Communications: An International Journal10.1007/s11277-022-09802-y126:2(1481-1514)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1007/s11277-022-09802-y
Ardalan ZKarimi SPoursabzi ONaderi B(2015)A novel imperialist competitive algorithm for generalized traveling salesman problemsApplied Soft Computing10.1016/j.asoc.2014.08.03326:C(546-555)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1016/j.asoc.2014.08.033
Moazzez-Estanjini RWang JPaschalidis I(2013)Scheduling mobile nodes for cooperative data transport in sensor networksIEEE/ACM Transactions on Networking10.1109/TNET.2012.221689721:3(974-989)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1109/TNET.2012.2216897
Hu BRaidl G(2008)Effective neighborhood structures for the generalized traveling salesman problemProceedings of the 8th European conference on Evolutionary computation in combinatorial optimization10.5555/1792634.1792638(36-47)Online publication date: 26-Mar-2008
https://dl.acm.org/doi/10.5555/1792634.1792638
Tasgetiren MSuganthan PPan QLipson H(2007)A discrete particle swarm optimization algorithm for the generalized traveling salesman problemProceedings of the 9th annual conference on Genetic and evolutionary computation10.1145/1276958.1276980(158-167)Online publication date: 7-Jul-2007
https://dl.acm.org/doi/10.1145/1276958.1276980
Tarantilis CKiranoudis CVassiliadis V(2002)A backtracking adaptive threshold accepting algorithm for the vehicle routing problemSystems Analysis Modelling Simulation10.1080/71606718342:5(631-664)Online publication date: 1-May-2002
https://dl.acm.org/doi/10.1080/716067183
Ladurantaye D(2001)A hybrid genetic algorithm for the Generalized Traveling Salesman ProblemProceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation10.5555/2955239.2955447(1167-1172)Online publication date: 7-Jul-2001
https://dl.acm.org/doi/10.5555/2955239.2955447

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents