The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
The pickup and delivery problem with time windows
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
Integer Programming Formulation of Traveling Salesman Problems
Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960) · Journal of the ACM · doi:10.1145/321043.321046 · Cited by 2,020
Psaraftis, H. N. (1980) · Transportation Science · doi:10.1287/trsc.14.2.130 · Cited by 601
Survey Paper—Time Window Constrained Routing and Scheduling Problems
Solomon, M. M., & Desrosiers, J. (1988) · Transportation Science · doi:10.1287/trsc.22.1.1 · Cited by 552
Self-citationChristofides, N., Mingozzi, A., & Toth, P. (1981) · Mathematical Programming · doi:10.1007/bf01589353 · Cited by 535
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 522
Routing with time windows by column generation
Desrosiers, J., Soumis, F., & Desrochers, M. (1984) · Networks · doi:10.1002/net.3230140406 · Cited by 366
Self-citationA Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
Desrochers, M., & Soumis, F. (1988) · INFOR: Information Systems and Operational Research · doi:10.1080/03155986.1988.11732063 · Cited by 349
Self-citationA Column Generation Approach to the Urban Transit Crew Scheduling Problem
Desrochers, M., & Soumis, F. (1989) · Transportation Science · doi:10.1287/trsc.23.1.1 · Cited by 332
Self-citationExact Algorithms for the Vehicle Routing Problem
Gilbert Laporte, A., & Nobert, Y. (1987) · North-Holland mathematics studies · doi:10.1016/s0304-0208(08)73235-3 · Cited by 318
Vehicle Routing with Time Windows
Kolen, A. W. J., Kan, A. H. G. R., & Trienekens, H. W. J. M. (1987) · Operations Research · doi:10.1287/opre.35.2.266 · Cited by 304
Cited by
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
The General Pickup and Delivery Problem
Savelsbergh, M. W. P., & Sol, M. (1995) · Transportation Science · doi:10.1287/trsc.29.1.17 · Cited by 1,042
A review of design and control of automated guided vehicle systems
Le-Anh, T., & De Koster, M. B. M. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.01.036 · Cited by 473
Drive: Dynamic Routing of Independent Vehicles
Savelsbergh, M., & Sol, M. (1998) · Operations Research · doi:10.1287/opre.46.4.474 · Cited by 334
Real-Time City-Scale Taxi Ridesharing
Ma, S., Zheng, Y., & Wolfson, O. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2334313 · Cited by 329
Metadata
- Authors
- Dumas, Y., Desrosiers, J., & Soumis, F.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 1991-09
- Volume
- 54
- Issue
- 1
- Pages
- 7-22
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2048314949
- Cited by
- 667
- References
- 15
- FWCI
- 6.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: The pickup and delivery problem with time windows. https://app.cochat.ai/papers/10.1016/0377-2217(91)90319-q
- The paper
- Dumas, Y., Desrosiers, J., & Soumis, F. (1991). The pickup and delivery problem with time windows. European Journal of Operational Research. https://doi.org/10.1016/0377-2217(91)90319-q
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.
