Journal
EXPERT SYSTEMS WITH APPLICATIONS
Volume 42, Issue 1, Pages 390-410Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2014.07.054
Keywords
Ant Colony Optimisation; Swarm intelligence; Self-organisation; Artificial intelligence; Multi-agent system
Categories
Funding
- CICYT Spanish Committee [DPI2009-14552-C02-01]
Ask authors/readers for more resources
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. (C) 2014 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available