Ant Colony Based Algorithms for Dynamic Optimization Problems

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.

[1]  Marco Dorigo,et al.  Ant colony optimization for continuous domains , 2008, Eur. J. Oper. Res..

[2]  Harilaos N. Psaraftis,et al.  Dynamic vehicle routing: Status and prospects , 1995, Ann. Oper. Res..

[3]  Hartmut Schmeck,et al.  Designing evolutionary algorithms for dynamic optimization problems , 2003 .

[4]  Jürgen Branke,et al.  Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.

[5]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[6]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[7]  Marcus Randall,et al.  Dynamic Problems and Nature Inspired Meta-Heuristics , 2006, 2006 Second IEEE International Conference on e-Science and Grid Computing (e-Science'06).

[8]  Stephen F. Smith,et al.  Ant colony control for autonomous decentralized shop floor routing , 2001, Proceedings 5th International Symposium on Autonomous Decentralized Systems.

[9]  Nicolas Monmarch,et al.  Artificial Ants , 2010 .

[10]  Hans-Paul Schwefel,et al.  Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.

[11]  J. Deneubourg,et al.  Self-organized shortcuts in the Argentine ant , 1989, Naturwissenschaften.

[12]  Cyrille Bertelle,et al.  Organization Detection Using Emergent Computing , 2006, Int. Trans. Syst. Sci. Appl..

[13]  Tim Hendtlass,et al.  Ant Colony Optimisation Applied to a Dynamically Changing Problem , 2002, IEA/AIE.

[14]  Shengxiang Yang,et al.  Evolutionary Computation in Dynamic and Uncertain Environments , 2007, Studies in Computational Intelligence.

[15]  Roberto Montemanni,et al.  A new algorithm for a Dynamic Vehicle Routing Problem based on Ant Colony System , 2002 .

[16]  Vittorio Maniezzo,et al.  Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem , 1999, INFORMS J. Comput..

[17]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[18]  Thomas Stützle,et al.  ACO algorithms for the quadratic assignment problem , 1999 .

[19]  Yoann Pigné,et al.  Short and Robust Communication Paths in Dynamic Wireless Networks , 2010, ANTS Conference.

[20]  Martin Middendorf,et al.  Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP , 2001, EvoWorkshops.

[21]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[22]  Daniel Angus.  The Current State of Ant Colony Optimisation Applied to Dynamic Problems , 2006 .

[23]  Michael Guntsch,et al.  Applying Population Based ACO to Dynamic Optimization Problems , 2002, Ant Algorithms.

[24]  Abdunnaser Younes,et al.  Adapting Evolutionary Approaches for Optimization in Dynamic Environments , 2006 .

[25]  Christian Blum,et al.  Ant colony optimization: Introduction and recent trends , 2005 .

[26]  Agostinho C. Rosa,et al.  Binary ant algorithm , 2007, GECCO '07.

[27]  Ronald W. Morrison,et al.  Designing Evolutionary Algorithms for Dynamic Environments , 2004, Natural Computing Series.

[28]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[29]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[30]  Helen H. Lou,et al.  ACS–based dynamic optimization for curing of polymeric coating , 2006 .

[31]  Marco Dorigo.  Ant colony optimization , 2004, Scholarpedia.

[32]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[33]  Tim Blackwell,et al.  Particle Swarm Optimization in Dynamic Environments , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

[34]  Jurij Silc,et al.  The Differential Ant-Stigmergy Algorithm applied to dynamic optimization problems , 2009, 2009 IEEE Congress on Evolutionary Computation.

[35]  Hong Tat Ewe,et al.  Ant Colony Optimization Approaches for the Dynamic Load-Balanced Clustering Problem in Ad Hoc Networks , 2007, 2007 IEEE Swarm Intelligence Symposium.

[36]  Jürgen Branke,et al.  Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.

[37]  Jurij Silc,et al.  The differential ant-stigmergy algorithm: an experimental evaluation and a real-world application , 2007, 2007 IEEE Congress on Evolutionary Computation.

[38]  Guillermo Leguizamón,et al.  Canonical Metaheuristics for Dynamic Optimization Problems , 2009 .

[39]  Léon J. M. Rothkrantz,et al.  Ant-Based Load Balancing in Telecommunications Networks , 1996, Adapt. Behav..

[40]  C. J. Eyckelhof,et al.  Ant Systems for a Dynamic TSP , 2002, Ant Algorithms.

[41]  Rolf Drechsler,et al.  Applications of Evolutionary Computing, EvoWorkshops 2008: EvoCOMNET, EvoFIN, EvoHOT, EvoIASP, EvoMUSART, EvoNUM, EvoSTOC, and EvoTransLog, Naples, Italy, March 26-28, 2008. Proceedings , 2008, EvoWorkshops.

[42]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[43]  Agostinho C. Rosa,et al.  UMDAs for dynamic optimization problems , 2008, GECCO '08.

[44]  Leonora Bianchi.  Notes on dynamic vehicle routing - the state of the art - , 2000 .

[45]  Paul W. H. Chung,et al.  Developments in Applied Artificial Intelligence , 2003, Lecture Notes in Computer Science.

[46]  Tim Hendtlass,et al.  Dynamic Ant Colony Optimisation , 2005, Applied Intelligence.

[47]  Martin Middendorf,et al.  A Population Based Approach for ACO , 2002, EvoWorkshops.

[48]  P.-P. Grasse.  La reconstruction du nid et les coordinations interindividuelles chezBellicositermes natalensis etCubitermes sp. la théorie de la stigmergie: Essai d'interprétation du comportement des termites constructeurs , 1959, Insectes Sociaux.

[49]  Richard F. Hartl,et al.  D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..

[50]  Hartmut Schmeck,et al.  An Ant Colony Optimization approach to dynamic TSP , 2001 .

[51]  Cyrille Bertelle,et al.  Organization detection for dynamic load balancing in individual-based simulations , 2007, Multiagent Grid Syst..