Article thumbnail

Candidate Set Strategies for Ant Colony

By Marcus R and James Montgomery

Abstract

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

Topics: Ant colony optimisation, candidate set
Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.159.4597
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ict.swin.edu.au/per... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.