Candidate set strategies for ant colony optimisation

Marcus Randall, James Montgomery

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

14 Citations (Scopus)
242 Downloads (Pure)


Ant Colony Optimisation based solvers systematically scan the set of possible solution elements before choosing a particular one. Hence, the computational time required for each step of the algorithm can be large. One way to overcome this is to limit the number of element choices to a sensible subset, or candidate set. This paper describes some novel generic candidate set strategies and tests these on the travelling salesman and car sequencing problems. The results show that the use of candidate sets helps to find competitive solutions to the test problems in a relatively short amount of time.

Original languageEnglish
Title of host publicationAnt Algorithms - 3rd International Workshop, ANTS 2002, Proceedings
EditorsMarco Dorigo , Gianni di Caro, Michael Sampels
PublisherSpringer-Verlag London Ltd.
Number of pages7
ISBN (Print)9783540457244
Publication statusPublished - 1 Jan 2002
Event3rd International Workshop on Ant Algorithms, ANTS 2002 - Brussels, Belgium
Duration: 12 Sept 200214 Sept 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd International Workshop on Ant Algorithms, ANTS 2002


Dive into the research topics of 'Candidate set strategies for ant colony optimisation'. Together they form a unique fingerprint.

Cite this