### 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.

Original language | English |
---|---|

Title of host publication | Ant Algorithms - 3rd International Workshop, ANTS 2002, Proceedings |

Editors | Marco Dorigo , Gianni di Caro, Michael Sampels |

Publisher | Springer-Verlag London Ltd. |

Pages | 243-249 |

Number of pages | 7 |

ISBN (Print) | 9783540457244 |

DOIs | |

Publication status | Published - 1 Jan 2002 |

Event | 3rd International Workshop on Ant Algorithms, ANTS 2002 - Brussels, Belgium Duration: 12 Sep 2002 → 14 Sep 2002 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 2463 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 3rd International Workshop on Ant Algorithms, ANTS 2002 |
---|---|

Country | Belgium |

City | Brussels |

Period | 12/09/02 → 14/09/02 |

### Fingerprint

### Cite this

*Ant Algorithms - 3rd International Workshop, ANTS 2002, Proceedings*(pp. 243-249). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2463). Springer-Verlag London Ltd.. https://doi.org/10.1007/3-540-45724-0_22

}

*Ant Algorithms - 3rd International Workshop, ANTS 2002, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2463, Springer-Verlag London Ltd., pp. 243-249, 3rd International Workshop on Ant Algorithms, ANTS 2002, Brussels, Belgium, 12/09/02. https://doi.org/10.1007/3-540-45724-0_22

**Candidate set strategies for ant colony optimisation.** / Randall, Marcus; Montgomery, James.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

TY - GEN

T1 - Candidate set strategies for ant colony optimisation

AU - Randall, Marcus

AU - Montgomery, James

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84974707321&partnerID=8YFLogxK

U2 - 10.1007/3-540-45724-0_22

DO - 10.1007/3-540-45724-0_22

M3 - Conference contribution

SN - 9783540457244

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 243

EP - 249

BT - Ant Algorithms - 3rd International Workshop, ANTS 2002, Proceedings

A2 - Dorigo , Marco

A2 - di Caro, Gianni

A2 - Sampels, Michael

PB - Springer-Verlag London Ltd.

ER -