Improving exploration in Ant Colony Optimisation with antennation
Ant Colony Optimisation (ACO) algorithms use two heuristics to solve computational problems: one long-term (pheromone) and the other short-term (local heuristic). This paper details the development of antennation, a mid-term heuristic based on an analogous process in real ants. This is incorporated into ACO for the Travelling Salesman Problem (TSP). Antennation involves sharing information of the previous paths taken by ants, including information gained from previous meetings. Antennation was...[Show more]
|Collections||ANU Research Publications|
|Source:||2012 IEEE Congress on Evolutionary Computation Proceedings|
|Beer_Improving2012.pdf||1.05 MB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.