Near parameter free ant colony optimisation

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

29 Citations (Scopus)
16 Downloads (Pure)

Abstract

Ant colony optimisation, like all other meta-heuristic search processes, requires a set of parameters in order to solve combinatorial problems. These parameters are often tuned by hand by the researcher to a set that seems to work well for the problem under study or a standard set from the literature. However, it is possible to integrate a parameter search process within the running of the meta-heuristic without incurring an undue computational overhead. In this paper, ant colony optimisation is used to evolve suitable parameter values (using its own optimisation processes) while it is solving combinatorial problems. The results reveal for the travelling salesman and quadratic assignment problems that the use of the augmented solver generally performs well against one that uses a standard set of parameter values. This is attributed to the fact that parameter values suitable for the particular problem instance can be automatically derived and varied throughout the search process.

Original languageEnglish
Title of host publicationAnt Colony Optimization and Swarm Intelligence
Subtitle of host publicationANTS 2004
EditorsM Dorigo, M Birattari, C Blum, L M Gambardella, F Mondada, T Stutzle
Place of PublicationHeidelberg
PublisherSpringer
Pages374-381
Number of pages8
Volume3172 LNCS
ISBN (Print)3540226729, 9783540226727
DOIs
Publication statusPublished - 2004
EventInternational Workshop on Ant Colony Optimization and Swarm Intelligence - Brussels, Belgium
Duration: 5 Sep 20048 Sep 2004
Conference number: 4th
http://iridia.ulb.ac.be/ants/ants2004/
http://iridia.ulb.ac.be/ants/ants2004/

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3172 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

ConferenceInternational Workshop on Ant Colony Optimization and Swarm Intelligence
Abbreviated title ANTS 2004
CountryBelgium
CityBrussels
Period5/09/048/09/04
Internet address

Fingerprint

Ant colony optimization
Combinatorial Problems
Metaheuristics
Travelling salesman
Quadratic Assignment Problem
Heuristic Search
Process Optimization
Integrate

Cite this

Randall, M. (2004). Near parameter free ant colony optimisation. In M. Dorigo, M. Birattari, C. Blum, L. M. Gambardella, F. Mondada, & T. Stutzle (Eds.), Ant Colony Optimization and Swarm Intelligence : ANTS 2004 (Vol. 3172 LNCS, pp. 374-381). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3172 LNCS). Heidelberg: Springer. https://doi.org/10.1007/978-3-540-28646-2_37
Randall, Marcus. / Near parameter free ant colony optimisation. Ant Colony Optimization and Swarm Intelligence : ANTS 2004. editor / M Dorigo ; M Birattari ; C Blum ; L M Gambardella ; F Mondada ; T Stutzle. Vol. 3172 LNCS Heidelberg : Springer, 2004. pp. 374-381 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{492eacf7798041198cbea785d7cea55f,
title = "Near parameter free ant colony optimisation",
abstract = "Ant colony optimisation, like all other meta-heuristic search processes, requires a set of parameters in order to solve combinatorial problems. These parameters are often tuned by hand by the researcher to a set that seems to work well for the problem under study or a standard set from the literature. However, it is possible to integrate a parameter search process within the running of the meta-heuristic without incurring an undue computational overhead. In this paper, ant colony optimisation is used to evolve suitable parameter values (using its own optimisation processes) while it is solving combinatorial problems. The results reveal for the travelling salesman and quadratic assignment problems that the use of the augmented solver generally performs well against one that uses a standard set of parameter values. This is attributed to the fact that parameter values suitable for the particular problem instance can be automatically derived and varied throughout the search process.",
author = "Marcus Randall",
year = "2004",
doi = "10.1007/978-3-540-28646-2_37",
language = "English",
isbn = "3540226729",
volume = "3172 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "374--381",
editor = "M Dorigo and M Birattari and C Blum and Gambardella, {L M} and F Mondada and T Stutzle",
booktitle = "Ant Colony Optimization and Swarm Intelligence",
address = "Germany",

}

Randall, M 2004, Near parameter free ant colony optimisation. in M Dorigo, M Birattari, C Blum, LM Gambardella, F Mondada & T Stutzle (eds), Ant Colony Optimization and Swarm Intelligence : ANTS 2004. vol. 3172 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3172 LNCS, Springer, Heidelberg, pp. 374-381, International Workshop on Ant Colony Optimization and Swarm Intelligence, Brussels, Belgium, 5/09/04. https://doi.org/10.1007/978-3-540-28646-2_37

Near parameter free ant colony optimisation. / Randall, Marcus.

Ant Colony Optimization and Swarm Intelligence : ANTS 2004. ed. / M Dorigo; M Birattari; C Blum; L M Gambardella; F Mondada; T Stutzle. Vol. 3172 LNCS Heidelberg : Springer, 2004. p. 374-381 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3172 LNCS).

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

TY - GEN

T1 - Near parameter free ant colony optimisation

AU - Randall, Marcus

PY - 2004

Y1 - 2004

N2 - Ant colony optimisation, like all other meta-heuristic search processes, requires a set of parameters in order to solve combinatorial problems. These parameters are often tuned by hand by the researcher to a set that seems to work well for the problem under study or a standard set from the literature. However, it is possible to integrate a parameter search process within the running of the meta-heuristic without incurring an undue computational overhead. In this paper, ant colony optimisation is used to evolve suitable parameter values (using its own optimisation processes) while it is solving combinatorial problems. The results reveal for the travelling salesman and quadratic assignment problems that the use of the augmented solver generally performs well against one that uses a standard set of parameter values. This is attributed to the fact that parameter values suitable for the particular problem instance can be automatically derived and varied throughout the search process.

AB - Ant colony optimisation, like all other meta-heuristic search processes, requires a set of parameters in order to solve combinatorial problems. These parameters are often tuned by hand by the researcher to a set that seems to work well for the problem under study or a standard set from the literature. However, it is possible to integrate a parameter search process within the running of the meta-heuristic without incurring an undue computational overhead. In this paper, ant colony optimisation is used to evolve suitable parameter values (using its own optimisation processes) while it is solving combinatorial problems. The results reveal for the travelling salesman and quadratic assignment problems that the use of the augmented solver generally performs well against one that uses a standard set of parameter values. This is attributed to the fact that parameter values suitable for the particular problem instance can be automatically derived and varied throughout the search process.

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

U2 - 10.1007/978-3-540-28646-2_37

DO - 10.1007/978-3-540-28646-2_37

M3 - Conference contribution

SN - 3540226729

SN - 9783540226727

VL - 3172 LNCS

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

SP - 374

EP - 381

BT - Ant Colony Optimization and Swarm Intelligence

A2 - Dorigo, M

A2 - Birattari, M

A2 - Blum, C

A2 - Gambardella, L M

A2 - Mondada, F

A2 - Stutzle, T

PB - Springer

CY - Heidelberg

ER -

Randall M. Near parameter free ant colony optimisation. In Dorigo M, Birattari M, Blum C, Gambardella LM, Mondada F, Stutzle T, editors, Ant Colony Optimization and Swarm Intelligence : ANTS 2004. Vol. 3172 LNCS. Heidelberg: Springer. 2004. p. 374-381. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-28646-2_37