Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 414

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

Ant Colony System for a Dynamic Vehicle Routing Problem

Open access
Montemanni, R., Gambardella, L. M., Rizzoli, A. E., Donati, A. V.·2005·Journal of Combinatorial Optimization

Abstract

An aboundant literature on vehicle routing problems is available. However, most of the work deals with static problems, where all data are known in advance, i.e. before the optimization has started.The technological advances of the last few years give rise to a new class of problems, namely the dynamic vehicle routing problems, where new orders are received as time progresses and must be dynamically incorporated into an evolving schedule.In this paper a dynamic vehicle routing problem is examined and a solving strategy, based on the Ant Colony System paradigm, is proposed.Some new public domain benchmark problems are defined, and the algorithm we propose is tested on them.Finally, the method we present is applied to a realistic case study, set up in the city of Lugano (Switzerland).

Overview

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1007/s10878-005-4922-6

Cites

18 of 18 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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 18 references

Cited by

See all 414

Metadata

Authors
Montemanni, R., Gambardella, L. M., Rizzoli, A. E., & Donati, A. V.
Venue
Journal of Combinatorial Optimization
Published
2005-12
Volume
10
Issue
4
Pages
327-343
ISSN
  • 1382-6905 (ISSN-L)
  • 1573-2886
OpenAlex
W2079747430
Cited by
414
References
18
FWCI
41.65
Type
journal article
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: Ant Colony System for a Dynamic Vehicle Routing Problem. https://app.cochat.ai/papers/10.1007/s10878-005-4922-6
The paper
Montemanni, R., Gambardella, L. M., Rizzoli, A. E., & Donati, A. V. (2005). Ant Colony System for a Dynamic Vehicle Routing Problem. Journal of Combinatorial Optimization. https://doi.org/10.1007/s10878-005-4922-6

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.