Ant Colony Extended: Experiments on the Travelling Salesman Problem

作者：

Highlights：

• This paper studies of the performance of Ant Colony Extended to the Travelling Salesman Problem.

• The algorithm includes two kinds of ants: patrollers (exploration search) and foragers (exploitation search).

• The algorithm includes a population dynamics allows the algorithm to self-organise.

• The algorithm is able to solve the Travelling Salesman Problem successfully compared with other classical ant algorithms.

摘要

•This paper studies of the performance of Ant Colony Extended to the Travelling Salesman Problem.•The algorithm includes two kinds of ants: patrollers (exploration search) and foragers (exploitation search).•The algorithm includes a population dynamics allows the algorithm to self-organise.•The algorithm is able to solve the Travelling Salesman Problem successfully compared with other classical ant algorithms.

论文关键词：Ant Colony Optimisation,Swarm intelligence,Self-organisation,Artificial intelligence,Multi-agent system

论文评审过程：Available online 12 August 2014.

论文官网地址：https://doi.org/10.1016/j.eswa.2014.07.054