Abstract
Ant colony algorithms are a class of metaheuristics which are inspired from the behaviour of real ants. The original idea consisted in simulating the trail communication, therefore these algorithms are considered as a form of adaptive memory programming. A new formalization is proposed for the design of ant colony algorithms, introducing the biological notions of heterarchy and communication channels.
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. Bilchev and I.C. Parmee. The Ant Colony Metaphor for Searching Continuous Design Spaces. Lecture Notes in Computer Science, 993:25–39, 1995.
E. Bonabeau, A. Sobkowski, G. Theraulaz, and J.-L. Deneubourg. Adaptive Task Allocation Inspired by a Model of Division of Labor in Social Insects. BCEC, pages 36–45, 1997.
S. Camazine, J.L. Deneubourg, N. Franks, J. Sneyd, G. Theraulaz, and E. Bonabeau. Self-Organization in Biological Systems. 2000.
A. Colorni, M. Dorigo, and V. Maniezzo. Distributed Optimization by Ant Colonies. In Elsevier Publishing, editor, Proceedings of ECAL’91-European Conference on Arti.cial Life, pages 134–142, 1991.
J. Dréo. Modélisation de la mobilisation chez les fourmis. Mémoire de dea, Université Paris7 & Université Libre de Bruxelles, 2001.
Glover F. and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
B. Hölldobler and E.O. Wilson. The Ants. Springer Verlag, 1990.
J. Kennedy and R. C. Eberhart. Particle swarm optimization. In Proc. IEEE Int. Conf. on Neural Networks, volume IV, pages 1942–1948, Piscataway, NJ: IEEE Service Center, 1995.
N. Monmarché, G. Venturini, and M. Slimane. On how Pachycondyla apicalis ants suggest a new search algorithm. Future Generation Computer Systems, 16:937–946, 2000.
E.D. Taillard, L. Gambardella, M. Gendreau, and J-Y. Potvin. Adaptive Memory Programming: A Unified View of Metaheuristics. In EURO XVI Conference Tutorial and Research Reviews booklet, Brussels, 1998. EURO.
E.O. Wilson and B. Hölldobler. Dense Heterarchy and mass communication as the basis of organization in ant colonies. Trend in Ecology and Evolution, 3:65–68, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dréo, J., Siarry, P. (2005). A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions. 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_18
Download citation
DOI: https://doi.org/10.1007/3-540-45724-0_18
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