Skip navigation
Skip navigation

Improving exploration in Ant Colony Optimisation with antennation

Beer, Christopher; Hendtlass, Tim; Montgomery, James


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]

CollectionsANU Research Publications
Date published: 2012-06
Type: Conference paper
Source: 2012 IEEE Congress on Evolutionary Computation Proceedings
DOI: 10.1109/CEC.2012.6252923


File Description SizeFormat Image
Beer_Improving2012.pdf1.05 MBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator