Multi-colony ant algorithms for the dynamic travelling salesman problem

A multi-colony ant colony optimization (ACO) algorithm consists of several colonies of ants. Each colony uses a separate pheromone table in an attempt to maximize the search area explored. Over the years, multi-colony ACO algorithms have been successfully applied on different optimization problems with stationary environments. In this paper, we investigate their performance in dynamic environments. Two types of algorithms are proposed: homogeneous and heterogeneous approaches, where colonies share the same properties and colonies have their own (different) properties, respectively. Experimental results on the dynamic travelling salesman problem show that multi-colony ACO algorithms have promising performance in dynamic environments when compared with single colony ACO algorithms.

[1]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[2]  Martin Middendorf,et al.  An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem , 1998, PPSN.

[3]  Dirk Sudholt,et al.  Homogeneous and Heterogeneous Island Models for the Set Cover Problem , 2012, PPSN.

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

[5]  Zbigniew Michalewicz,et al.  Searching for optima in non-stationary environments , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[6]  Jürgen Branke,et al.  A Multi-population Approach to Dynamic Optimization Problems , 2000 .

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

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

[9]  Cyril Fonlupt,et al.  Parallel Ant Colonies for the quadratic assignment problem , 2001, Future Gener. Comput. Syst..

[10]  Ernesto Costa,et al.  Multi-caste Ant Colony Algorithm for the Dynamic Traveling Salesperson Problem , 2013, ICANNGA.

[11]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[12]  Thomas Stützle,et al.  An analysis of communication policies for homogeneous multi-colony ACO algorithms , 2010, Inf. Sci..

[13]  Jürgen Branke,et al.  Multi-swarm Optimization in Dynamic Environments , 2004, EvoWorkshops.

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

[15]  Shengxiang Yang,et al.  Evolutionary dynamic optimization: A survey of the state of the art , 2012, Swarm Evol. Comput..

[16]  Martin Middendorf,et al.  An ACO algorithm for the shortest common supersequence problem , 1999 .

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

[18]  Barbara Webb,et al.  Swarm Intelligence: From Natural to Artificial Systems , 2002, Connect. Sci..

[19]  Shengxiang Yang,et al.  Adapting the Pheromone Evaporation Rate in Dynamic Routing Problems , 2013, EvoApplications.

[20]  Hartmut Schmeck,et al.  Multi Colony Ant Algorithms , 2002, J. Heuristics.

[21]  Xin Yao,et al.  A Benchmark Generator for Dynamic Permutation-Encoded Problems , 2012, PPSN.

[22]  Shengxiang Yang,et al.  A memetic ant colony optimization algorithm for the dynamic travelling salesman problem , 2011, Soft Comput..

[23]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[24]  Martín Pedemonte,et al.  A survey on parallel ant colony optimization , 2011, Appl. Soft Comput..

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

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

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

[28]  Shengxiang Yang,et al.  Metaheuristics for dynamic combinatorial optimization problems. , 2013 .

[29]  Shengxiang Yang,et al.  Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors , 2013, Appl. Soft Comput..

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

[31]  Hartmut Schmeck,et al.  Information Exchange in Multi Colony Ant Algorithms , 2000, IPDPS Workshops.