Ant colony optimization: a new meta-heuristic
Top Cited Papers
- 20 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1470-1477
- https://doi.org/10.1109/cec.1999.782657
Abstract
Recently, a number of algorithms inspired by the foraging behavior of ant colonies have been applied to the solution of difficult discrete optimization problems. In this paper we put these algorithms in a common frame- work by defining the Ant Colony Optimization (ACO) meta-heuristic. A couple of paradigmatic examples of ap- plications of these novel meta-heuristic are given, as well as a brief overview of existing applications.Keywords
This publication has 12 references indexed in Scilit:
- An ant colony optimization approach for the single machine total tardiness problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The ant system applied to the quadratic assignment problemIEEE Transactions on Knowledge and Data Engineering, 1999
- Improvements on the Ant-System: Introducing the MAX-MIN Ant SystemPublished by Springer Nature ,1998
- An island model based ant system with lookahead for the shortest supersequence problemPublished by Springer Nature ,1998
- Parallelization strategies for Ant Colony OptimizationPublished by Springer Nature ,1998
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- Ants can colour graphsJournal of the Operational Research Society, 1997
- Ant-Based Load Balancing in Telecommunications NetworksAdaptive Behavior, 1997
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965