The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
Abstract
This paper considers the vehicle routing problem with stochastic demands. The objective is to provide an overview of this problem, and to examine a variety of solution methodologies. The concepts and the main issues are reviewed along with some properties of optimal solutions. The existing stochastic mathematical programming formulations are presented and compared and a new formulation is proposed. A new solution framework for the problem using Markovian decision processes is then 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.
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
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
Clarke, G., & Wright, J. W. (1964) · Operations Research · doi:10.1287/opre.12.4.568 · Cited by 3,894
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
(1986) · Journal of the Operational Research Society · doi:10.1057/jors.1986.93 · Cited by 1,679
The Traveling Salesman Problem
(2019) · Fundamentals of Supply Chain Theory · doi:10.1002/9781119584445.ch10 · Cited by 1,614
Stochastic models in operations research
Heyman, D. P., & Sobel, M. J. (1982) · Medical Entomology and Zoology · Cited by 1,041
VEHICLE ROUTING: METHODS AND STUDIES
Golden, B., & Assad, A. A. (1988) · North-Holland eBooks · Cited by 691
The Traveling-Salesman Problem
Flood, M. M. (1956) · Operations Research · doi:10.1287/opre.4.1.61 · Cited by 682
White, C. C., & White, D. J. (1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90348-2 · Cited by 415
The Fastest Path through a Network with Random Time-Dependent Travel Times
Hall, R. W. (1986) · Transportation Science · doi:10.1287/trsc.20.3.182 · Cited by 404
State‐space relaxation procedures for the computation of bounds to routing problems
Christofides, N., Mingozzi, A., & Toth, P. (1981) · Networks · doi:10.1002/net.3230110207 · Cited by 330
Exact 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
Cited by
A review of dynamic vehicle routing problems
Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.08.015 · Cited by 1,253
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
Gendreau, M., Laporte, G., & Séguin, R. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(95)00050-x · Cited by 640
Self-citationThe Vehicle Routing Problem with Stochastic Travel Times
Laporte, G., Louveaux, F., & Mercure, H. (1992) · Transportation Science · doi:10.1287/trsc.26.3.161 · Cited by 435
Self-citationAn Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
Laporte, G., Louveaux, F. V., & van Hamme, L. (2002) · Operations Research · doi:10.1287/opre.50.3.415.7751 · Cited by 289
Self-citation
Metadata
- Authors
- Dror, M., Laporte, G., & Trudeau, P.
- Venue
- Transportation Science
- Published
- 1989-08
- Volume
- 23
- Issue
- 3
- Pages
- 166-176
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2157062061
- Cited by
- 286
- References
- 11
- FWCI
- 4.57
- 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: Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks. https://app.cochat.ai/papers/10.1287/trsc.23.3.166
- The paper
- Dror, M., Laporte, G., & Trudeau, P. (1989). Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks. Transportation Science. https://doi.org/10.1287/trsc.23.3.166
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.
