Improving exploration in Ant Colony Optimisation with antennation

IEEE Congress on Evolutionary Computation(2012)

引用 6|浏览9
暂无评分
摘要
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.
更多
查看译文
关键词
ant colony optimisation,travelling salesman problems,ACO algorithms,ACS,AMTS algorithms,TSP,ant colony optimisation algorithm,ant colony system,ant multitour system algorithms,antennation,exploration improvement,local heuristic,long-term computational problems,midterm heuristic,pheromone,short-term computational problems,travelling salesman problem,Ant Colony Optimization,Mid-Range Heuristic,Travelling Salesman Problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要