Search Swinburne Research Bank
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/26093
|Download PDF (Author's final draft) (Adobe Acrobat PDF, -1 bytes)|
- Anti-pheromone as a tool for better exploration of search space
- Montgomery, James; Randall, Marcus
- 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.
- Publication type
- Conference paper
- Lecture Notes in Computer Science : Ant Algorithms : Proceedings 3rd International Workshop on Ant Algorithms (ANTS 2002), Brussels, Belgium, 12-14 September 2002, Vol. 2463, p. 100-110
- Publication year
- ACO; Algorithms; Animal models; Ant colony optimisation; Biologically-inspired computing; Constructive metaheuristic; Machine learning; Nature-inspired computing; Pheromone model; Solution bias; Travelling salesman problem
- Publisher URL
- Copyright © Springer Berlin Heidelberg 2002. The author's final draft of this paper is reproduced here in accordance with the copyright policy of the publisher. The original publication is available at www.springerlink.com.
- Full text
- Peer reviewed