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.
Lecture Notes in Computer Science : Ant Algorithms : Proceedings 3rd International Workshop on Ant Algorithms (ANTS 2002), Brussels, Belgium, 12-14 September 2002,
Vol. 2463, p. 243-249