Abstract
This paper presents a computational comparison of five heuristic algorithms for the traveling salesman problem (TSP). Each of these algorithms is a composite algorithm consisting of a simple tour construction algorithm and a post-processor. The five tour construction procedures considered are all insertion algorithms which may be easily implemented. The post-processor used in the five composite algorithms is a modified 3-opt procedure that is shown to outperform both the 3-opt and 2-opt branch exchange procedures. The final result of the computational tests is the conclusion that there are simple and easily implemented heuristic procedures that will produce high quality solutions to the TSP in a moderate amount of computer time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Christofides and S. Eilon, “An Algorithm for the Vehicle Dispatching Problem,” Operational Research Quarterly, 20, 309–318 (1969).
N. Christofides and S. Eilon, “Algorithms for Large Scale TSP’s,” Operational Research Quarterly, 23, 511–518 (1972)
G. Croes, “A Method for Solving Traveling Salesman Problems,” Operations Research, 6, 791–812 (1958).
H. P. Crowder and M. W. Padberg, “Large-Scale Symmetric Traveling Salesman Problems,” Management Science, 26, 495–409 (1980).
B. Golden, L. Bodin, T. Doyle, and W. Stewart, Jr., “Approximate Traveling Salesman Problems, Operations Research, 28, 694–711 (1980).
W. W. Hardgrave and G. L. Nemhauser, “On the Relation Between the Traveling Salesman Problem and the Longest Path Problem,” Operations Research, 10, 647–657 (1962).
P. Krolak, W. Felts, and G. Marble, “Efficient Heuristics for Solving Large Traveling Salesman Problems,” paper presented at the 7th Mathematical Symposium, Hague, Netherlands (1970).
S. Lin, “Computer Solutions of the TSP,” Bell Systems Technical Journal, 44, 2245–2269 (1965).
S. Lin and B. Kernighan, “An Effective Heuristic Algorithm for the Traveling Salesman Problem,” Operations Research, 21, 498–516 (1973).
J. P. Norback and R. F. Love, “Geometric Approaches to Solving the Traveling Salesman Problem,” Management Science, 23, 1208–1223 (1977).
J. P. Norback and R. F. Love, “Heuristic for the Hamiltonian Path Problem in Euclidean Two Space,” Operational Research, 30, 363–368 (1979).
I. Or, “Traveling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Blood Banking,” Ph.D. Thesis, Dept. of Industrial Engineering and Management Sciences, Northwestern University (1976).
F. P. Preparata and S. J. Hong, “Convex Hulls of Finite Sets of Points in Two and Three Dimensions,” Communications of ACM, 20, 87–92 (1977).
D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis, “Approximate Algorithms for the Traveling Salesperson Problem,” Proceedings of the 5th Annual IEEE Symposium on Switching and Automata Theory, 33–42 (1974).
W.R. Stewart, “A Computationally Efficient Heuristic for the Traveling Salesman Problem,” Proceedings of the 13th Annual Meeting of Southeastern TIMS, Myrtle Beach, S.C., 75–83 (1977).
B. E. Gillett and J. G. Johnson, “Mult-Terminal Vehicle-Dispatch Algorithm,” Omega, 4, 711–718 (1976).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stewart, W.R. (1982). A Computational Comparison of Five Heuristic Algorithms for the Euclidean Traveling Salesman Problem. In: Mulvey, J.M. (eds) Evaluating Mathematical Programming Techniques. Lecture Notes in Economics and Mathematical Systems, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95406-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-95406-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11495-6
Online ISBN: 978-3-642-95406-1
eBook Packages: Springer Book Archive