Search space reduction as a tool for achieving intensification and diversification in ant colony optimisation

Marcus Randall*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

2 Citations (Scopus)

Abstract

The aim of adding explicit intensification/diversification measures to ant colony optimisation is so that it better samples the search space. A new and novel method of achieving this is based on the idea of search space reduction in which solution components are fixed during an intensification stage and certain values for some components are excluded during diversification. These phases are triggered as required throughout the search process. In comparison to an existing intensification/diversification scheme and a control ant colony solver, the results using the travelling salesman problem reveal that the new scheme offers a substantial improvement. It often achieves optimal results for benchmark problem instances. Additionally, this scheme requires few extra computational resources and is applicable to a range of combinatorial problems.

Original languageEnglish
Title of host publicationAdvances in Applied Artificial Intelligence
Subtitle of host publicationIEA/AIE 2006
EditorsM Ali, R Dapoigny
PublisherSpringer
Pages254-261
Number of pages8
ISBN (Print)3-540-35453-0
DOIs
Publication statusPublished - 2006
Event19th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems - Annecy, France
Duration: 27 Jun 200630 Jun 2006
Conference number: 19th
http://www.polytech.univ-smb.fr/pub/ieaaie06/indexe371.html?id=18

Publication series

NameLECTURE NOTES IN COMPUTER SCIENCE
PublisherSPRINGER-VERLAG BERLIN
Volume4031
ISSN (Print)0302-9743

Conference

Conference19th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems
Abbreviated titleIEA/AIE
CountryFrance
CityAnnecy
Period27/06/0630/06/06
Internet address

Cite this