CoChat

An Introduction to Ant Colony Optimization

Open access
Dorigo, Marco, Socha, Krzysztof · 2018 · Handbook of Approximation Algorithms and Metaheuristics, Second Edition
Cited by 183

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Abstract

This chapter presents an overview of ant colony optimization (ACO)—a metaheuristic inspired by the behavior of real ants. ACO was proposed by Dorigo et al. as a method for solving hard combinatorial optimization problems (COPs). ACO was inspired by the observation of the behavior of real ants. One of the first researchers to investigate the social behavior of insects was the French entomologist Pierre-Paul Grasse. In the 40s and 50s of the twentieth century, he was observing the behavior of termites—in particular, the Bellicositermes natalensis and Cubitermes species. He discovered that these insects are capable to react to what he called “significant stimuli,” signals that activate a genetically encoded reaction. ACO has been formalized into a combinatorial optimization metaheuristic by Dorigo et al. and has since been used to tackle many COPs. Given a COP, the first step for the application of ACO to its solution consists in defining an adequate model.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1201/9781351236423-23

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 4 references

Metadata

Authors
Dorigo, M., & Socha, K.
Venue
Handbook of Approximation Algorithms and Metaheuristics, Second Edition
Published
2018-05-15
Pages
395-408
OpenAlex
W797950765
Cited by
183
References
4
FWCI
7.62
Type
book chapter
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: An Introduction to Ant Colony Optimization. https://app.cochat.ai/papers/10.1201/9781351236423-23
The paper
Dorigo, M., & Socha, K. (2018). An Introduction to Ant Colony Optimization. Handbook of Approximation Algorithms and Metaheuristics, Second Edition. https://doi.org/10.1201/9781351236423-23

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.