@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",
note = "20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE-2007 ; Conference date: 26-06-2007 Through 29-06-2007",
}