Abstract
In this paper we present a new Ants System approach to a dynamic Travelling Salesman Problem. Here the travel times between the cities are subject to change. To handle this dynamism several ways of adapting the pheromone matrix both locally and globally are considered. We show that the strategy of smoothing pheromone values only in the area containing a change leads to improved 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
Christian Blum and Andrea Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. Technical Report TR/IRIDIA/2001-13, IRIDIA, 2001.
Eric Bonabeau, Marco Dorigo, and Guy Theraulaz. Swarm Intelligence. From Natural to Artificial Systems. Studies in the Sciences of Complexity. Oxford University Press, 1999.
M. Dorigo and L.M. Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53–66, 1997.
M. Dorigo, V. Maniezzo, and A. Colorni. Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics-Part B, 26(1):29–41, 1996.
Marco Dorigo and Gianni Di Caro. Ant algorithms for discrete optimization. Artificial life, 5(2):137–172, 1999.
Casper Joost Eyckelhof. Ant systems for dynamic problems, the TSP case-ants caught in a traffic jam. Master’s thesis, University of Twente, The Netherlands, August 2001. Available throug http://www.eyckelhof.nl.
M. Guntsch and M. Middendorf. Pheromone modification strategies for ant algorithms applied to dynamic TSP. In Applications of Evolutionary Computing: Proceedings of EvoWorkshops 2001. Springer Verlag, 2001.
Michael Guntsch, Jurgen Branke, Martin Middendorf, and Hartmut Schmeck. ACO strategies for dynamic TSP. In Marco Dorigo et al., editor, Abstract Proceedings of ANTS’2000, pages 59–62, 2000.
Michael Guntsch, Martin Middendorf, and Hartmut Schmeck. An ant colony optimization approach to dynamic TSP. In Lee Spector et al., editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 860–867, San Francisco, California, USA, 7–11 July 2001. Morgan Kaufmann.
T. Stützle and H. Hoos. Improvements on the ant system: Introducing MAX(MIN) ant system. In G.D. Smith, N.C. Steele, and R.F. Albrecht, editors, Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, pages 245–249. Springer-Verlag, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eyckelhof, C.J., Snoek, M. (2002). Ant Systems for a Dynamic TSP. In: Dorigo, M., Di Caro, G., Sampels, M. (eds) Ant Algorithms. ANTS 2002. Lecture Notes in Computer Science, vol 2463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45724-0_8
Download citation
DOI: https://doi.org/10.1007/3-540-45724-0_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44146-5
Online ISBN: 978-3-540-45724-4
eBook Packages: Springer Book Archive