Ant Colony Optimization
Teofilo F. Gonzalez
Abstract
Teofilo F. Gonzalez
Abstract
This chapter presents an overview of ant colony optimization (ACO)—a metaheuristic inspired by the behavior of real ants. Ant colony optimization was proposed by Dorigo and colleagues [1-3] as a method for solving hard combinatorial optimization problems (COPs).
OpenAlex reports 6658 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This chapter presents an overview of ant colony optimization (ACO)—a metaheuristic inspired by the behavior of real ants. Ant colony optimization was proposed by Dorigo and colleagues [1-3] as a method for solving hard combinatorial optimization problems (COPs).
Key concepts: Ant colony optimization algorithms, Swarm intelligence, Metaheuristic, Foraging, Ant colony, Computer science, Parallel metaheuristic, Exploit