Lecture Notes in Computer Science Volume 2463, 2002, pp 243-249
Date: 23 Aug 2002

Candidate Set Strategies for Ant Colony Optimisation

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.

This author is a PhD scholar supported by an Australian Postgraduate Award.