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

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

Randall, M. (2006). Search space reduction as a tool for achieving intensification and diversification in ant colony optimisation. In M. Ali, & R. Dapoigny (Eds.), Advances in Applied Artificial Intelligence: IEA/AIE 2006 (pp. 254-261). (LECTURE NOTES IN COMPUTER SCIENCE; Vol. 4031). Springer. https://doi.org/10.1007/11779568_29
Randall, Marcus. / Search space reduction as a tool for achieving intensification and diversification in ant colony optimisation. Advances in Applied Artificial Intelligence: IEA/AIE 2006. editor / M Ali ; R Dapoigny. Springer, 2006. pp. 254-261 (LECTURE NOTES IN COMPUTER SCIENCE).
@inproceedings{7270044e46fd495e8df0069c1a6ad044,
title = "Search space reduction as a tool for achieving intensification and diversification in ant colony optimisation",
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.",
author = "Marcus Randall",
year = "2006",
doi = "10.1007/11779568_29",
language = "English",
isbn = "3-540-35453-0",
series = "LECTURE NOTES IN COMPUTER SCIENCE",
publisher = "Springer",
pages = "254--261",
editor = "M Ali and R Dapoigny",
booktitle = "Advances in Applied Artificial Intelligence",
address = "Germany",

}

Randall, M 2006, Search space reduction as a tool for achieving intensification and diversification in ant colony optimisation. in M Ali & R Dapoigny (eds), Advances in Applied Artificial Intelligence: IEA/AIE 2006. LECTURE NOTES IN COMPUTER SCIENCE, vol. 4031, Springer, pp. 254-261, 19th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, Annecy, France, 27/06/06. https://doi.org/10.1007/11779568_29

Search space reduction as a tool for achieving intensification and diversification in ant colony optimisation. / Randall, Marcus.

Advances in Applied Artificial Intelligence: IEA/AIE 2006. ed. / M Ali; R Dapoigny. Springer, 2006. p. 254-261 (LECTURE NOTES IN COMPUTER SCIENCE; Vol. 4031).

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

TY - GEN

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

AU - Randall, Marcus

PY - 2006

Y1 - 2006

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

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

U2 - 10.1007/11779568_29

DO - 10.1007/11779568_29

M3 - Conference contribution

SN - 3-540-35453-0

T3 - LECTURE NOTES IN COMPUTER SCIENCE

SP - 254

EP - 261

BT - Advances in Applied Artificial Intelligence

A2 - Ali, M

A2 - Dapoigny, R

PB - Springer

ER -

Randall M. Search space reduction as a tool for achieving intensification and diversification in ant colony optimisation. In Ali M, Dapoigny R, editors, Advances in Applied Artificial Intelligence: IEA/AIE 2006. Springer. 2006. p. 254-261. (LECTURE NOTES IN COMPUTER SCIENCE). https://doi.org/10.1007/11779568_29