Abstract
The demon algorithm is a new metaheuristic that has been used to solve the traveling salesman problem (TSP). Several variants of the demon algorithm have been proposed in the literature and have been tested against annealing procedures on Euclidean TSPs; for the most part, they have performed well. In this paper, we propose three new variants of the demon algorithm and test them against simulated annealing and two existing demon algorithms on 36 well-known TSPs. We find that the new variants are easy to explain and generate very good results.
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
G. Box and M. Muller. A note on the generation of normal deviates. Annals of Mathematical Statistics, 29:610–611, 1958.
G. Clarke and J. Wright. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4):568–581, 1964.
M. Creutz. Microcanonical Monte Carlo simulation. Physical Review Letters, 50(19):1411–1414, 1983.
G. Dueck. New optimization heuristics: The great deluge algorithm and the record-to-record travel. Journal of Computational Physics, 104:86–92, 1993.
G. Dueck and T. Scheuer. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics, 90:161–175, 1990.
B. Golden, J. Pepper, and T. Vossen. Using genetic algorithms for setting parameter values in heuristic search. In Intelligent Engineering Systems through Artificial Neural Networks, volume 8, pages 239–245, New York, 1998. ASME Press.
S. Kirkpatrick, C. Gelatt, and M. Vecchi. Optimization by simulated annealing. Science, 220:671–680, 1983.
S. Lin. Computer solutions of the traveling salesman problem. The Dell System Technical Journal, 44:2245–2269, 1965.
N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21:1087–1092, 1953.
I. Osman and J. Kelly. Meta-heuristics: An overview. In I. Osman and J. Kelly, editors, Meta-heuristics: Theory and Applications, pages 1–21, Boston, MA, 1996. Kluwer Academic Publishers.
J. Pepper. A computational study of annealing-based heuristics for the traveling salesman problem. Master’s thesis, R. H. Smith School of Business, University of Maryland, College Park, 1999.
J. Pepper, B. Golden, and E. Wasil. Solving the traveling salesman problem with annealing-based heuristics: A computational study. IEEE Transactions on Systems, Man, and Cybernetics A, 32(1):72–77, 2002.
C. Reeves. Modern Heuristic Techniques for Solving Combinatorial Problems. Halstead Press, New York, 2002.
G. Reinelt. TSPLIB — A traveling salesman problem library. ORSA Journal on Computing, 3(4):376–384, 1991.
C. Ribeiro and P. Hansen, editors. Essays and Surveys in Metaheuristics. Kluwer, Boston, 2001.
S. Voß. Metaheuristics: The state of the art. In A. Nareyek, editor, Local Search for Planning and Scheduling, volume 2148 of Lecture Notes in Computer Science, pages 1–23, Heidelberg, 2001. Springer.
I. Wood and T. Downs. Demon algorithms and their application to optimization problems. In IEEE World Congress on Computational Intelligence, pages 1661–1666, New York, 1998. IEEE.
I. Wood and T. Downs. Fast optimization by demon algorithms. In ACNN ‘98: 9th Australian Conference on Neural Networks, Brisbane, Australia, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Chandran, B., Golden, B., Wasil, E. (2003). A Computational Study of Three Demon Algorithm Variants for Solving the Traveling Salesman Problem. In: Bhargava, H.K., Ye, N. (eds) Computational Modeling and Problem Solving in the Networked World. Operations Research/Computer Science Interfaces Series, vol 21. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1043-7_8
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1043-7_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5366-9
Online ISBN: 978-1-4615-1043-7
eBook Packages: Springer Book Archive