Abstract
The use of metaheuristic approaches to deal with dynamic optimization problems has been largely studied, being evolutionary techniques the more widely used and assessed techniques. Nevertheless, successful applications coming from other nature-inspired metaheuristics, e.g., ant algorithms, have also shown their applicability in dynamic optimization problems, but received a limited attention until now. Different from perturbative techniques, ant algorithms use a set of agents which evolve in an environment to construct one solution. They cooperate by means of asynchronous communications based on numerical information laid on an environment. This environment is often modeled by a graph which constitutes a formalism with a great expressiveness, specially well-suited for dynamic optimization problems. A solution could be a structure like a subgraph, a route, a short path, a spanning tree, or even a partition of vertices. In this chapter we present a general overview of the more relevant works regarding the application of ant colony based algorithms for dynamic optimization problems. We will also highlight the mechanisms used in different implementations found in the literature, and thus show the potential of this kind of algorithms for research in this area.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Particle Swarm Optimization
- Quadratic Assignment Problem
- Pheromone Trail
- Heuristic Information
- Dynamic Optimization Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abdunnaser, Y.: Adapting Evolutionary Approaches for Optimization in Dynamic Environments. PhD thesis, University of Waterloo, Waterloo, Ontario, Canada (2006)
Angus, D.: The current state of ant colony optimisation applied to dynamic problems. Technical Report TR009, Centre for Intelligent Systems & Complex Processes, Faculty of Information & Communication Technologies Swinburne University of Technology, Melbourne, Australia (2006)
Angus, D., Hendtlass, T.: Ant Colony Optimisation Applied to a Dynamically Changing Problem. In: Hendtlass, T., Ali, M. (eds.) IEA/AIE 2002. LNCS (LNAI), vol. 2358, pp. 618–627. Springer, Heidelberg (2002)
Angus, D., Hendtlass, T.: Dynamic ant colony optimisation. Applied Intelligence 23(1), 33–38 (2005)
Bertelle, C., Dutot, A., Guinand, F., Olivier, D.: Organization Detection Using Emergent Computing. International Transactions on Systems Science and Applications 2(1), 61–70 (2006)
Bertelle, C., Dutot, A., Guinand, F., Olivier, D.: Organization Detection for Dynamic Load Balancing in Individual-Based Simulations. Multi-Agent and Grid Systems 3(1), 42 (2007)
Bianchi, L.: Notes on dynamic vehicle routing - the state of the art. Technical Report IDSIA 05-01, Istituto Dalle Molle di Studi sull’ Intelligenza Artificiale (IDSIA), Manno-Lugano, Switzerland (2000)
Blackwell, T.: Particle Swarm Optimization in Dynamic Environments. In: Yang, S., Ong, Y., Jin, Y. (eds.) Evolutionary Computation in Dynamic and Uncertain Environments. SCI, vol. 51, pp. 29–49. Springer, Heidelberg (2007)
Blum, C.: Ant colony optimization: Introduction and recent trends. Physics of Life Reviews 2(4), 353–373 (2005)
Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers, Norwell (2002)
Branke, J., Schmeck, H.: Designing evolutionary algorithms for dynamic optimization problems. In: Advances in Evolutionary Computing, pp. 239–262. Springer-Verlag New York, Inc. (2003)
Bullnheimer, B., Hartl, R.F., Strauss, C.: An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89, 319–328 (1999)
Cicirello, V.A., Smith, S.F.: Ant Colony Control for Autonomous Decentralized Shop Floor Routing. In: International Symposium on Autonomous Decentralized Systems, pp. 383–390. IEEE Computer Society, Dallas (2001)
Di Caro, G., Dorigo, M.: AntNet: distributed stigmergetic control for communications networks. J. Artif. Int. Res. 9, 317–365 (1998)
Dorigo, M., Gambardella, L.M.: Ant Colony System: a Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)
Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a colony of cooperating agents. IEEE Trans. on Systems, Man, and Cybernetics–Part B 26(1), 29–41 (1996)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press (2004)
Eyckelhof, C.J., Snoek, M.: Ant Systems for a Dynamic TSP. In: Proceedings of the Third International Workshop on Ant Algorithms, ANTS 2002, pp. 88–99. Springer, London (2002)
Fernandes, C.M., Lima, C., Rosa, A.C.: UMDAs for dynamic optimization problems. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO 2008, pp. 399–406. ACM, New York (2008)
Fernandes, C.M., Rosa, A.C., Ramos, V.: Binary ant algorithm. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO 2007, pp. 41–48. ACM, New York (2007)
Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society 50(2), 167–176 (1999)
Goss, S., Aron, S., Deneubourg, J.L., Pasteels, J.M.: Self-organized shortcuts in the argentine ant. Naturwissenschaften 76, 579–581 (1989)
Grassé, P.P.: La reconstruction du nid et les coordinations interindividuelles chez bellicositermes natalensis et cubitermes sp. la theéorie de la stigmergie: Essai díinterprétation du comportement des termites constructeurs. Insectes Sociaux 6(1), 41–48 (1959)
Guntsch, M., Middendorf, M.: Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol. 2037, pp. 213–222. Springer, Heidelberg (2001)
Guntsch, M., Middendorf, M.: Applying population based aco to dynamic optimization problems. In: Proceedings of the Third International Workshop on Ant Algorithms, ANTS 2002, pp. 111–122. Springer (2002)
Guntsch, M., Middendorf, M.: A Population Based Approach for ACO. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, vol. 2279, pp. 72–81. Springer, Heidelberg (2002)
Guntsch, M., Middendorf, M., Schmeck, H.: An Ant Colony Optimization Approach to Dynamic TSP. In: Spector, L., Goodman, E.D., Wu, A., Langdon, W.B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M.H., Burke, E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2001, pp. 860–867. Morgan Kaufmann, San Francisco (2001)
Hendtlass, T., Moser, I., Randall, M.: Dynamic Problems and Nature Inspired Meta-Heuristics. In: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing, E-SCIENCE 2006, pp. 111–116. IEEE Computer Society, Washington, DC (2006)
Ho, C.K., Ewe, H.T.: Ant Colony Optimization Approaches for the Dynamic Load-Balanced Clustering Problem in Ad Hoc Networks. In: Swarm Intelligence Symposium, SIS 2007, pp. 76–83. IEEE (April 2007)
Jin, Y., Branke, J.: Evolutionary optimization in uncertain environments - A survey. IEEE Transactions on Evolutionary Computation 9(3), 303–318 (2005)
Korošec, P., Šilc, J.: The differential ant-stigmergy algorithm applied to dynamic optimization problems. In: Proceedings of the Eleventh Conference on Congress on Evolutionary Computation, CEC 2009, pp. 407–414. IEEE Press, Piscataway (2009)
Korošec, P., Šilc, J., Oblak, K., Kosel, F.: The differential ant-stigmergy algorithm: an experimental evaluation and a real-world application. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 157–164 (September 2007)
Leguizamón, G., Ordóñez, G., Molina, S., Alba, E.: Canonical Metaheuristics for Dynamic Optimization Problems. In: Alba, E., Blum, C., Isasi, P., León, C., Gómez, J.A. (eds.) Optimization Techniques for Solving Complex Problems, pp. 83–100. John Wiley & Sons, Inc. (2008)
Maniezzo, V.: Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem. Informs Journal on Computing 11(4), 358–369 (1999)
Monmarché, N., Guinand, F., Siarry, P.: Artificial Ants. Wiley-ISTE (2010)
Montemanni, R., Gambardella, L.M., Rizzoli, A.E., Donati, A.V.: A new algorithm for a Dynamic Vehicle Routing Problem based on Ant Colony System. In: Second International Workshop on Freight Transportation and Logistics, pp. 27–30 (2003)
Morrison, R.W.: Designing Evolutionary Algorithms for Dynamic Environments. Natural Computing Series. Springer (2004)
Mühlenbein, H., Paass, G.: From Recombination of Genes to the Estimation of Distributions I. Binary Parameters. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 178–187. Springer, Heidelberg (1996)
Pigné, Y., Guinand, F.: Short and Robust Communication Paths in Dynamic Wireless Networks. In: Dorigo, M., Birattari, M., Di Caro, G.A., Doursat, R., Engelbrecht, A.P., Floreano, D., Gambardella, L.M., Groß, R., Şahin, E., Sayama, H., Stützle, T. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 520–527. Springer, Heidelberg (2010)
Psaraftis, H.N.: Dynamic vehicle routing: Status and prospect. Annals Operations Research 61, 143–164 (1995)
Reimann, M., Doerner, K., Hartl, R.F.: D-ants: Savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research 31(4), 563–591 (2004)
Schoonderwoerd, R., Holland, O.E., Bruten, J.L., Rothkrantz, L.J.M.: Ant-based load balancing in telecommunications networks. Adaptive Behavior 2, 169–207 (1996)
Socha, K., Dorigo, M.: Ant colony optimization for continuous domains. European Journal of Operational Research 185(3), 1155–1173 (2008)
Stützle, T., Dorigo, M.: ACO algorithms for the quadratic assignment problem. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 33–50. McGraw Hill, London (1999)
Xiao, J., Li, J., Xu, Q., Huang, W., Lou, H.: ACS-based Dynamic Optimization for Curing of Polymeric Coating. The American Institute of Chemical Engineers (AIChE) Journal 52(2), 1410–1422 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Leguizamón, G., Alba, E. (2013). Ant Colony Based Algorithms for Dynamic Optimization Problems. In: Alba, E., Nakib, A., Siarry, P. (eds) Metaheuristics for Dynamic Optimization. Studies in Computational Intelligence, vol 433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30665-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-30665-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30664-8
Online ISBN: 978-3-642-30665-5
eBook Packages: EngineeringEngineering (R0)