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

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

Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows

Desaulniers, Guy, Lessard, François, Hadjar, Ahmed · 2008 · Transportation Science

Abstract

The vehicle routing problem with time windows consists of delivering goods at minimum cost to a set of customers using an unlimited number of capacitated vehicles assigned to a single depot. Each customer must be visited within a prescribed time window. The most recent successful solution methods for this problem are branch-and-price-and-cut algorithms where the column generation subproblem is an elementary shortest-path problem with resource constraints (ESPPRC). In this paper, we propose new ideas having the potential to improve such a methodology. First, we develop a tabu search heuristic for the ESPPRC that allows, in most iterations, the generation of negative reduced cost columns in a short computation time. Second, to further accelerate the subproblem solution process, we propose to relax the elementarity requirements for a subset of the nodes. This relaxation, however, yields weaker lower bounds. Third, we introduce a generalization of the k-path inequalities and highlight that these generalized inequalities can, in theory, be stronger than the traditional ones. Finally, combining these ideas with the most recent advances published in the literature, we present a wide variety of computational results on the Solomon's 100-customer benchmark instances. In particular, we report solving five previously unsolved instances.

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.1287/trsc.1070.0223

Cites

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

Cited by

See all 237

Metadata

Authors
Desaulniers, G., Lessard, F., & Hadjar, A.
Venue
Transportation Science
Published
2008-08
Volume
42
Issue
3
Pages
387-404
ISSN
  • 0041-1655 (ISSN-L)
  • 1526-5447
OpenAlex
W2135680984
Cited by
237
References
2
FWCI
21.27
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: Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows. https://app.cochat.ai/papers/10.1287/trsc.1070.0223
The paper
Desaulniers, G., Lessard, F., & Hadjar, A. (2008). Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows. Transportation Science. https://doi.org/10.1287/trsc.1070.0223

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.