Ant Colony Extended: Experiments on the Travelling Salesman Problem

• 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 Extended (ACE) is a novel algorithm belonging to the general Ant Colony Optimisation (ACO) framework. Two specific features of ACE are: the division of tasks between two kinds of ants, namely patrollers and foragers, and the implementation of a regulation policy to control the number of each kind of ant during the searching process. In addition, ACE does not employ the construction graph usually employed by classical ACO algorithms. Instead, the search is performed using a state space exploration approach. This paper studies the performance of ACE in the context of the Travelling Salesman Problem (TSP), a classical combinatorial optimisation problem. The results are compared with the results of two well known ACO algorithms: ACS and MMAS. ACE shows better performance than ACS and MMAS in almost every TSP tested instance.