Anti-pheromone as a Tool for Better Exploration of Search Space

Many animals use chemical substances known as pheromones to induce behavioural changes in other members of the same species. The use of pheromones by ants in particular has lead to the development of a number of computational analogues of ant colony behaviour including Ant Colony Optimisation. Although many animals use a range of pheromones in their communication, ant algorithms have typically focused on the use of just one, a substance that encourages succeeding generations of (artificial) ants to follow the same path as previous generations. Ant algorithms for multi-objective optimisation and those employing multiple colonies have made use of more than one pheromone, but the interactions between these different pheromones are largely simple extensions of single criterion, single colony ant algorithms. This paper investigates an alternative form of interaction between normal pheromone and anti-pheromone. Three variations of Ant Colony System that apply the anti-pheromone concept in different ways are described and tested against benchmark travelling salesman problems. The results indicate that the use of anti-pheromone can lead to improved performance. However, if anti-pheromone is allowed too great an influence on ants' decisions, poorer performance may result.

[1]  Masahito Yamamoto,et al.  Improved Multiple Ant Colonies System for Traveling Salesman Problems , 2002 .

[2]  Erhan Kozan,et al.  Operations research/management science at work , 2002 .

[3]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[4]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

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

[6]  Masahito Yamamoto,et al.  Multiple Ant Colonies Algorithm Based on Colony Level Interactions , 2000 .

[7]  Sumit Ghosh,et al.  A Study of Synthetic Creativity: Behavior Modeling and Simulation of an Ant Colony , 2000, IEEE Intell. Syst..

[8]  Marcus Randall,et al.  The Accumulated Experience Ant Colony for the Traveling Salesman Problem , 2003, Int. J. Comput. Intell. Appl..

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

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

[11]  Sumit Ghosh,et al.  A study of synthetic creativity through behavior modeling and simulation of an ant colony , 2001, Proceedings 5th International Symposium on Autonomous Decentralized Systems.

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

[13]  Marcus Randall,et al.  A General Framework for Constructive Meta-Heuristics , 2002 .

[14]  C. Mariano,et al.  MOAQ an Ant-Q algorithm for multiple objective optimization problems , 1999 .

[15]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

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

[17]  Daniel Merkle,et al.  Bi-Criterion Optimization with Multi Colony Ant Algorithms , 2001, EMO.

[18]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[19]  M. Winston,et al.  Pheromone Communication in Social Insects , 1997 .