Competitive ant colony optimisation

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

Abstract

The usual assumptions of the ant colony meta-heuristic are that each ant constructs its own complete solution and that it will then operate relatively independently of the rest of the colony (with only loose communications via the pheromone structure). However, a more aggressive approach is to allow some measure of competition amongst the ants. Two ways in which this can be done are to allow ants to take components from other ants or limit the number of ants that can make a particular component assignment. Both methods involve a number of competitions so that the probabilistic best assignment of component to ant can be made. Both forms of competitive ant colony optimisation outperform a standard implementation on the benchmark set of the assignment type problem, generalised assignment.

Original languageEnglish
Title of host publicationNew Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings
EditorsHiroshi G Okuno, Moonis Ali
Place of Publication Berlin, Heidelberg
PublisherSpringer
Pages974-983
Number of pages10
Volume4570
ISBN (Print)9783540733225
DOIs
Publication statusPublished - 2007
Event20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE-2007 - Kyoto, Japan
Duration: 26 Jun 200729 Jun 2007

Publication series

NameLecture Notes in Computer Science
Volume4570
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

Conference20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE-2007
CountryJapan
CityKyoto
Period26/06/0729/06/07

Fingerprint

Ants
Ant colony optimization
Assignment
Pheromones
Generalized Assignment Problem
Pheromone
Ant Colony
Metaheuristics
Communication
Benchmark
Benchmarking

Cite this

Randall, M. (2007). Competitive ant colony optimisation. In H. G. Okuno, & M. Ali (Eds.), New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings (Vol. 4570, pp. 974-983). (Lecture Notes in Computer Science ; Vol. 4570). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-540-73325-6_97
Randall, Marcus. / Competitive ant colony optimisation. New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings. editor / Hiroshi G Okuno ; Moonis Ali. Vol. 4570 Berlin, Heidelberg : Springer, 2007. pp. 974-983 (Lecture Notes in Computer Science ).
@inproceedings{965e70f07c8142439de2eddf795dc72b,
title = "Competitive ant colony optimisation",
abstract = "The usual assumptions of the ant colony meta-heuristic are that each ant constructs its own complete solution and that it will then operate relatively independently of the rest of the colony (with only loose communications via the pheromone structure). However, a more aggressive approach is to allow some measure of competition amongst the ants. Two ways in which this can be done are to allow ants to take components from other ants or limit the number of ants that can make a particular component assignment. Both methods involve a number of competitions so that the probabilistic best assignment of component to ant can be made. Both forms of competitive ant colony optimisation outperform a standard implementation on the benchmark set of the assignment type problem, generalised assignment.",
author = "Marcus Randall",
year = "2007",
doi = "10.1007/978-3-540-73325-6_97",
language = "English",
isbn = "9783540733225",
volume = "4570",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "974--983",
editor = "Okuno, {Hiroshi G} and Moonis Ali",
booktitle = "New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings",
address = "Germany",

}

Randall, M 2007, Competitive ant colony optimisation. in HG Okuno & M Ali (eds), New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings. vol. 4570, Lecture Notes in Computer Science , vol. 4570, Springer, Berlin, Heidelberg, pp. 974-983, 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE-2007, Kyoto, Japan, 26/06/07. https://doi.org/10.1007/978-3-540-73325-6_97

Competitive ant colony optimisation. / Randall, Marcus.

New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings. ed. / Hiroshi G Okuno; Moonis Ali. Vol. 4570 Berlin, Heidelberg : Springer, 2007. p. 974-983 (Lecture Notes in Computer Science ; Vol. 4570).

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

TY - GEN

T1 - Competitive ant colony optimisation

AU - Randall, Marcus

PY - 2007

Y1 - 2007

N2 - The usual assumptions of the ant colony meta-heuristic are that each ant constructs its own complete solution and that it will then operate relatively independently of the rest of the colony (with only loose communications via the pheromone structure). However, a more aggressive approach is to allow some measure of competition amongst the ants. Two ways in which this can be done are to allow ants to take components from other ants or limit the number of ants that can make a particular component assignment. Both methods involve a number of competitions so that the probabilistic best assignment of component to ant can be made. Both forms of competitive ant colony optimisation outperform a standard implementation on the benchmark set of the assignment type problem, generalised assignment.

AB - The usual assumptions of the ant colony meta-heuristic are that each ant constructs its own complete solution and that it will then operate relatively independently of the rest of the colony (with only loose communications via the pheromone structure). However, a more aggressive approach is to allow some measure of competition amongst the ants. Two ways in which this can be done are to allow ants to take components from other ants or limit the number of ants that can make a particular component assignment. Both methods involve a number of competitions so that the probabilistic best assignment of component to ant can be made. Both forms of competitive ant colony optimisation outperform a standard implementation on the benchmark set of the assignment type problem, generalised assignment.

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

U2 - 10.1007/978-3-540-73325-6_97

DO - 10.1007/978-3-540-73325-6_97

M3 - Conference contribution

SN - 9783540733225

VL - 4570

T3 - Lecture Notes in Computer Science

SP - 974

EP - 983

BT - New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings

A2 - Okuno, Hiroshi G

A2 - Ali, Moonis

PB - Springer

CY - Berlin, Heidelberg

ER -

Randall M. Competitive ant colony optimisation. In Okuno HG, Ali M, editors, New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings. Vol. 4570. Berlin, Heidelberg: Springer. 2007. p. 974-983. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-540-73325-6_97