Article (Published version) (147 Kb) - 
Private access
Highlights
More informations
Scientific Article
unige:26154 
 |
Optimization by ant algorithms: possible roles for an individual ant |
|
| Author | ||
| Published in | Optimization Letters. 2012, vol. 6, p. 963-973 | |
| Abstract | In most ant algorithms, the role of each ant is to build a solution in a constructive way, basing each decision on the greedy force and the trails. However, different roles are possible for each individual ant, ranging from a negligible help in the decision process to a refined local search heuristic. In this paper, the importance of the role assigned to each ant is discussed. Three general ant methodologies are presented. Comparative results are analyzed for the well-known graph coloring problem. | |
| Keywords | Metaheuristics — Ant algorithms — Graph coloring | |
| Full text | ||
| Structures | ||
| Citation (ISO format) | ZUFFEREY, Nicolas. Optimization by ant algorithms: possible roles for an individual ant. In: Optimization Letters, 2012, vol. 6, p. 963-973. https://archive-ouverte.unige.ch/unige:26154 |
253 hits 
0 download 
Contact an author
Update