Experiments with variants of ant algorithms.

Stützle, Thomas, and Linke, Sebastian. "Experiments with variants of ant algorithms.." Mathware and Soft Computing 9.2-3 (2002): 193-207. <http://eudml.org/doc/39243>.

@article{Stützle2002,
abstract = {A number of extensions of Ant System, the first ant colony optimization (ACO) algorithm, were proposed in the literature. These extensions typically achieve much improved computational results when compared to the original Ant System. However, many design choices of Ant System are left untouched including the fact that solutions are constructed, that real-numbers are used to simulate pheromone trails, and that explicit pheromone evaporation is used. In this article we experimentally investigate adaptations of ant algorithms to the traveling salesman problem that use alternative choices for these latter features: we consider using pheromones to modify solutions and different schemes for manipulating pheromone trails based on integer pheromone trails without recurring to pheromone evaporation.},
author = {Stützle, Thomas, Linke, Sebastian},
journal = {Mathware and Soft Computing},
keywords = {Optimización global; Algoritmo de búsqueda; Problema del viajante; Problemas combinatorios; Heurística; ant colony optimization algorithm},
language = {eng},
number = {2-3},
pages = {193-207},
title = {Experiments with variants of ant algorithms.},
url = {http://eudml.org/doc/39243},
volume = {9},
year = {2002},
}

TY - JOUR
AU - Stützle, Thomas
AU - Linke, Sebastian
TI - Experiments with variants of ant algorithms.
JO - Mathware and Soft Computing
PY - 2002
VL - 9
IS - 2-3
SP - 193
EP - 207
AB - A number of extensions of Ant System, the first ant colony optimization (ACO) algorithm, were proposed in the literature. These extensions typically achieve much improved computational results when compared to the original Ant System. However, many design choices of Ant System are left untouched including the fact that solutions are constructed, that real-numbers are used to simulate pheromone trails, and that explicit pheromone evaporation is used. In this article we experimentally investigate adaptations of ant algorithms to the traveling salesman problem that use alternative choices for these latter features: we consider using pheromones to modify solutions and different schemes for manipulating pheromone trails based on integer pheromone trails without recurring to pheromone evaporation.
LA - eng
KW - Optimización global; Algoritmo de búsqueda; Problema del viajante; Problemas combinatorios; Heurística; ant colony optimization algorithm
UR - http://eudml.org/doc/39243
ER -