TY - GEN
T1 - Improving exploration in ant colony optimisation with antennation
AU - Beer, Christopher
AU - Hendtlass, Tim
AU - Montgomery, James
PY - 2012
Y1 - 2012
N2 - 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 added to the Ant System (AS), Ant Colony System (ACS) and Ant Multi-Tour System (AMTS) algorithms. Tests were conducted on symmetric TSPs of varying size. Antennation provides an advantage when incorporated into algorithms without an inbuilt exploration mechanism and a disadvantage to those that do. AS and AMTS with antennation have superior performance when compared to their canonical form, with the effect increasing as problem size increases.
AB - 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 added to the Ant System (AS), Ant Colony System (ACS) and Ant Multi-Tour System (AMTS) algorithms. Tests were conducted on symmetric TSPs of varying size. Antennation provides an advantage when incorporated into algorithms without an inbuilt exploration mechanism and a disadvantage to those that do. AS and AMTS with antennation have superior performance when compared to their canonical form, with the effect increasing as problem size increases.
KW - Ant Colony Optimization
KW - Mid-Range Heuristic
KW - Travelling Salesman Problem
UR - http://www.scopus.com/inward/record.url?scp=84866844064&partnerID=8YFLogxK
U2 - 10.1109/CEC.2012.6252923
DO - 10.1109/CEC.2012.6252923
M3 - Conference contribution
SN - 9781467315098
T3 - 2012 IEEE Congress on Evolutionary Computation, CEC 2012
BT - 2012 IEEE Congress on Evolutionary Computation, CEC 2012
T2 - 2012 IEEE Congress on Evolutionary Computation, CEC 2012
Y2 - 10 June 2012 through 15 June 2012
ER -