Abstract
We investigate strategies for pheromone modification of ant algorithms in reaction to the insertion/deletion of a city of Traveling Salesperson Problem (TSP) instances. Three strategies for pheromone diversification through equalization of the pheromone values on the edges are proposed and compared. One strategy acts globally without consideration of the position of the inserted/deleted city. The other strategies perform pheromone modification only in the neighborhood of the inserted/deleted city, where neighborhood is defined differently for the two strategies. We furthermore evaluate different parameter settings for each of the strategies.
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
E. Bonabeau, M. Dorigo, G. Theraulaz: Swarm Intelligence: From Natural to Artificial Systems, Oxford University Press, New York, 1999.
M. Dorigo, G. Di Caro, “The ant colony optimization meta-heuristic”, in D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill, 11–32, 1999.
G. Di Caro, M. Dorigo, “AntNet: Distributed Stigmergetic Control for Communications Networks,” Journal of Artificial Intelligence Research, 9: 317–365, 1998.
R. Schoonderwoerd, O. Holland, J. Bruten, L. Rothkrantz, “Ant-based Load Balancing in Telecommunications Networks,” Adaptive Behavior, 1996.
B. Bullnheimer, R.F. Hartl, C. Strauss, “A New Rank Based Version of the Ant System-A Computational Study,” CEJOR, 7: 25–38, 1999.
M. Dorigo, “Optimization, Learning and Natural Algorithms (in Italian), ” PhD Thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, pp.140, 1992.
M. Dorigo, L.M. Gambardella, “Ant-Q: A Reinforcement Learning approach to the traveling salesman problem,” Proceedings of ML-95, Twelfth Intern. Conf. on Machine Learning, Morgan Kaufmann, 252–260, 1995.
M. Dorigo, and L.M. Gambardella, “Ant colony system: A cooperative learning approach to the travelling salesman problem,” IEEE TEC, 1: 53–66, 1997.
M. Dorigo, V. Maniezzo, A. Colorni, “The Ant System: Optimization by a Colony of Cooperating Agents,” IEEE Trans. Systems, Man, and Cybernetics-Part B, 26: 29–41, 1996.
T. Stützle, H. Hoos, “Improvements on the ant system: Introducing MAX(MIN) ant system,” in G.D. Smith et al. (Eds.), Proc. of the International Conf. on Artificial Neutral Networks and Genetic Algorithms, Springer-Verlag, 245–249, 1997.
L.-M. Gambardella, E.D. Taillard, M. Dorigo, “Ant Colonies for the Quadratic Assignment Problem,” Journal of the Operational Research Society, 50: 167–76, 1999.
T. Stützle, H. Hoos, “MAX-MIN Ant System,” Future Generation Computer Systems, 16: 889–914, 1999.
http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/
D. Merkle, M. Middendorf, H. Schmeck, “Ant Colony Optimization for Resource-Constrained Project Scheduling,” Proc. GECCO-2000, 893–900, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guntsch, M., Middendorf, M. (2001). Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP. In: Boers, E.J.W. (eds) Applications of Evolutionary Computing. EvoWorkshops 2001. Lecture Notes in Computer Science, vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45365-2_22
Download citation
DOI: https://doi.org/10.1007/3-540-45365-2_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41920-4
Online ISBN: 978-3-540-45365-9
eBook Packages: Springer Book Archive