Improved lower limits for pheromone trails in ant colony optimization

10Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Ant Colony Optimization algorithms were inspired by the foraging behavior of ants that accumulate pheromone trails on the shortest paths to food. Some ACO algorithms employ pheromone trail limits to improve exploration and avoid stagnation by ensuring a non-zero probability of selection for all trails. The MAX-MIN Ant System (MMAS) sets explicit pheromone trail limits while the Ant Colony System (ACS) has implicit pheromone trail limits. Stagnation still occurs in both algorithms with the recommended pheromone trail limits as the relative importance of the pheromone trails increases (α>∈1). Improved estimates of the lower pheromone trail limit (τmin ) for both algorithms help avoid stagnation and improve performance for α > 1. The improved estimates suggest a general rule to avoid stagnation for stochastic algorithms with explicit or implicit limits on exponential values used in proportional selection. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Matthews, D. C. (2008). Improved lower limits for pheromone trails in ant colony optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5199 LNCS, pp. 508–517). https://doi.org/10.1007/978-3-540-87700-4_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free