Ant Algorithms for Discrete Optimization
Marco Dorigo, Gianni A. Di, Luca Maria Gambardella · Artificial Life · 1999
This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' foraging behavior, and introduces the ant colony optimization (ACO) metaheuristic. In the first part of the article the basic biological findings on real ants are reviewed and their artificial counterparts as well as the ACO metaheuristic are defined. In the second part of the article a number of applications of ACO algorithms to combinatorial optimization and routing in communications networks are described. We conclude with a discussion of related work and of some of the most important aspects of the ACO metaheuristic.
Cited by 2,808 works. doi:10.1162/106454699568728
Authors
References
- Optimization by Simulated Annealing
- Adaptation in Natural and Artificial Systems
- Neural networks for pattern recognition
- Genetic Algorithms in Search, Optimization and Machine Learning
- Reinforcement Learning: An Introduction
- Computer Solutions of the Traveling Salesman Problem
- Introduction to the theory of neural computation
- Ant system: optimization by a colony of cooperating agents
- A Method for Solving Traveling-Salesman Problems
- Ant colony system: a cooperative learning approach to the traveling salesman problem