Abstract
Ant Colony Optimization (ACO) is a popular meta-heuristic for solving combinatorial optimization problems. ACO uses the concept of ants foraging for food to find good solutions to these types of problems. ACO has been successfully applied to many problems, from the traveling salesman problem (TSP), to the problem of network routing. However, it has been pointed out that ACO does not perform as well as other heuristics in very dynamic problems. At first, this statement seems strange but a close look reveals that the nature strategy that inspires the ACO meta-heuristic has an important element that is lacking in ACO: evolution. This paper proposes a new algorithm, named Evolutionary Ant Colony Optimization (EACO), that combines ACO with elements of traditional Genetic Algorithms (GA), namely: selection, recombination, and mutation. Individual ants are endowed with a genotype that is allowed to evolve through generations of the population. In doing this, the EACO algorithm adds another element of optimization to the ACO algorithm that allows the individual agents (ants) in the algorithm to improve their behavior over several generations. Our results demonstrate that EACO can indeed overcome the hurdles faced by the original ACO.
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
Angeline, P.J.: Using selection to improve particle swarm optimization. In: Proceedings of the 1998 IEEE World Congress on Computation Intelligence, pp. 84–89. IEEE Press, Los Alamitos (1998)
Botee, H.M., Bonabeau, E.: Evolving ant colony optimization. Advanced Complex Systems 1, 149–159 (1998)
Bourke, A.F., Franks, N.R.: Social Evolution in Ants. Princeton University Press, Princeton (1995)
Caro, G.D., Dorigo, M.: AntNet: a mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, Université Libre de Bruxelles, Belgium (1997)
Dorigo, M., Gambardella, L.: Ant colonies for the traveling salesman problem. BioSystems 43, 73–81 (1997)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Holland, J.H.: Adaptation in natural and artificial systems. MIT Press, Cambridge (1992)
Robinson, J., Sinton, S., Rahmat-Samii, Y.: Particle swarm, genetic algorithm, and their hybrids: Optimization of a profiled corrugated horn antenna. In: Proceedings of Antennas and Propagation Society International Symposium, vol. 1, pp. 314–317 (2002)
Settles, M., Soule, T.: Breeding swarms: A GA/PSO hybrid. In: Proceedings of the Genetic and Evolutionary Computation Conference, Seattle, Washington, USA (July 2004)
White, T., Pagurek, B., Oppacher, F.: ASGA: Improving the ant system by integration with genetic algorithms. In: Genetic Programming 1998: Proceedings of the Third Annual Conference, pp. 610–617. Morgan Kaufmann, San Francisco (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roach, C., Menezes, R. (2008). Handling Dynamic Networks Using Evolution in Ant-Colony Optimization. In: Nguyen, N.T., Borzemski, L., Grzech, A., Ali, M. (eds) New Frontiers in Applied Artificial Intelligence. IEA/AIE 2008. Lecture Notes in Computer Science(), vol 5027. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69052-8_83
Download citation
DOI: https://doi.org/10.1007/978-3-540-69052-8_83
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69045-0
Online ISBN: 978-3-540-69052-8
eBook Packages: Computer ScienceComputer Science (R0)