The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
A tabu search heuristic for the static multi-vehicle dial-a-ride problem
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.
Integrity signals
Registry
Cites
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.
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
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,008
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
A Tabu Search Heuristic for the Vehicle Routing Problem
Michel Gendreau, A., Hertz, A., & Gilbert Laporte, A. (1994) · Management Science · doi:10.1287/mnsc.40.10.1276 · Cited by 1,303
A unified tabu search heuristic for vehicle routing problems with time windows
Cordeau, J.-F., Laporte, G., & Mercier, A. (2001) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601163 · Cited by 897
Self-citationA tabu search heuristic for periodic and multi-depot vehicle routing problems
Cordeau, J.-F., Gendreau, M., & Laporte, G. (1997) · Networks · doi:10.1002/(sici)1097-0037(199709)30:2<105::aid-net5>3.0.co;2-g · Cited by 864
Self-citationThe pickup and delivery problem with time windows
Dumas, Y., Desrosiers, J., & Soumis, F. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90319-q · Cited by 667
A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows
Jaw, J.-J., Odoni, A. R., Psaraftis, H. N., & Wilson, N. H. M. (1986) · Transportation Research Part B Methodological · doi:10.1016/0191-2615(86)90020-2 · Cited by 624
Psaraftis, H. N. (1980) · Transportation Science · doi:10.1287/trsc.14.2.130 · Cited by 601
Cited by
Metaheuristics in Combinatorial Optimization
Gendreau, M., & Potvin, J.-Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3971-7 · Cited by 2,338
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Cordeau, J.-F. (2006) · Operations Research · doi:10.1287/opre.1060.0283 · Cited by 695
Self-citationA unified solution framework for multi-attribute vehicle routing problems
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.09.045 · Cited by 433
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.02.053 · Cited by 430
Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies
Ghiani, G., Guerriero, F., Laporte, G., & Musmanno, R. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00915-3 · Cited by 350
Self-citation
Metadata
- Authors
- Cordeau, J.-F., & Laporte, G.
- Venue
- Transportation Research Part B: Methodological
- Publisher
- Elsevier BV
- Published
- 2003-07
- Volume
- 37
- Issue
- 6
- Pages
- 579-594
- ISSN
- 0191-2615 (ISSN-L)
- OpenAlex
- W1985290529
- Cited by
- 702
- References
- 15
- FWCI
- 43.98
- 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: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. https://app.cochat.ai/papers/10.1016/s0191-2615(02)00045-0
- The paper
- Cordeau, J.-F., & Laporte, G. (2003). A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological. https://doi.org/10.1016/s0191-2615(02)00045-0
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.