Multi Colony Ant Algorithms

In multi colony ant algorithms several colonies of ants cooperate in finding good solutions for an optimization problem. At certain time steps the colonies exchange information about good solutions. If the amount of exchanged information is not too large multi colony ant algorithms can be easily parallelized in a natural way by placing the colonies on different processors. In this paper we study the behaviour of multi colony ant algorithms with different kinds of information exchange between the colonies. Moreover we compare the behaviour of different numbers of colonies with a multi start single colony ant algorithm. As test problems we use the Traveling Salesperson problem and the Quadratic Assignment problem.

[1]  Thomas Stützle,et al.  Improvements on the Ant-System: Introducing the MAX-MIN Ant System , 1997, ICANNGA.

[2]  Hartmut Schmeck,et al.  Experiences with fine‐grainedparallel genetic algorithms , 1999, Ann. Oper. Res..

[3]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[4]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

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

[6]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

[7]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

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

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

[10]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[11]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[12]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[13]  Thomas Stützle,et al.  Parallelization Strategies for Ant Colony Optimization , 1998, PPSN.

[14]  Pat Langley,et al.  Editorial: On Machine Learning , 1986, Machine Learning.

[15]  Patrice Roger Calégari.  Parallelization of population-based evolutionary algorithms for combinatorial optimization problems , 1999 .

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

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

[18]  K. Haase,et al.  Experiences with Fine-Grained Parallel Genetic Algorithms , 1996 .

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

[20]  Hartmut Schmeck,et al.  Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..

[21]  Gabriele Kotsis,et al.  Parallelization strategies for the ant system , 1998 .

[22]  Cyril Fonlupt,et al.  Parallel Ant Colonies for Combinatorial Optimization Problems , 1999, IPPS/SPDP Workshops.

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