Presentación | Participantes | Bibliografía (DML-E) | Bibliografía adicional | Enlaces de interés | Otros proyectos DML | Ayuda
INICIO |
27 de julio de 2024
Experiments with variants of ant algorithms.
| Título inglés | Experiments with variants of ant algorithms. |
|---|---|
| Título español | Experimentos con variantes de algoritmos de hormigas. |
| Autor/es | Stützle, Thomas ; Linke, Sebastian |
| Organización | Intell. Group Dep. Comp. Sci. Darmstadt Univ. Technol., Darmstadt, Alemania |
| Revista | 1134-5632 |
| Publicación | 2002, 9 (2-3): 193-207, 22 Ref. |
| Tipo de documento | articulo |
| Idioma | Inglés |
| Resumen inglés | 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. |
| Clasificación UNESCO | 120304 ; 120700 |
| Palabras clave español | Optimización global ; Algoritmo de búsqueda ; Problema del viajante ; Problemas combinatorios ; Heurística |
| Código Z-Math | Zbl 1036.68104 |
 Acceso al artículo completo |
|