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

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

Classical and modern heuristics for the vehicle routing problem

Laporte, G·2000·International Transactions in Operational Research

Abstract

Abstract This article is a survey of heuristics for the Vehicle Routing Problem . It is divided into two parts: classical and modern heuristics. The first part contains well‐known schemes such as, the savings method, the sweep algorithm and various two‐phase approaches. The second part is devoted to tabu search heuristics which have proved to be the most successful metaheuristic approach. Comparative computational results are presented.

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.1016/s0969-6016(00)00003-4

Cites

1 of 1 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 1 references

Cited by

See all 759

Metadata

Authors
Laporte, G.
Venue
International Transactions in Operational Research
Publisher
Wiley
Published
2000-09-01
Volume
7
Issue
4-5
Pages
285-300
ISSN
0969-6016 (ISSN-L)
OpenAlex
W2114939271
Cited by
759
References
1
FWCI
47.78
Type
journal article
Language
en
Open access
closed

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: Classical and modern heuristics for the vehicle routing problem. https://app.cochat.ai/papers/10.1016/s0969-6016(00)00003-4
The paper
Laporte, G. (2000). Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research. https://doi.org/10.1016/s0969-6016(00)00003-4

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.