2007Unpublished venueRequires access

Ant Colony Optimization

Teofilo F. Gonzalez

Open publisher page 6,658 citations

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).

About this research paper

What this paper is about

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).

Why it matters

OpenAlex reports 6658 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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).

Key concepts: Ant colony optimization algorithms, Swarm intelligence, Metaheuristic, Foraging, Ant colony, Computer science, Parallel metaheuristic, Exploit

Related papers

Back to paper searchBrowse research topicsOriginal source
Ant Colony Optimization — Research Paper | ScholarLens