Candidate Set Strategies for Ant Colony Optimisation

  • Marcus Randall
  • James Montgomery
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2463)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Marcus Randall
    • 1
  • James Montgomery
    • 1
  1. 1.School of Information TechnologyBond University Gold CoastQueenslandAustralia

Personalised recommendations