The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
The Vehicle Routing Problem with Stochastic Travel Times
Abstract
This paper considers vehicle routing problems (VRPs) with stochastic service and travel times, in which vehicles incur a penalty proportional to the duration of their route in excess of a preset constant. Three mathematical programming models are presented: a chance constrained model, a three-index simple recourse model and a two-index recourse model. A general branch and cut algorithm for the three models is described. Computational results indicate that moderate size problems can be solved to optimality.
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
Solution of a Large-Scale Traveling-Salesman Problem
Chvátal, V., Cook, W. J., Dantzig, G. B., Fulkerson, D. R., & Johnson, S. M. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_1 · Cited by 1,263
VEHICLE ROUTING: METHODS AND STUDIES
Golden, B., & Assad, A. A. (1988) · North-Holland eBooks · Cited by 691
A multicut algorithm for two-stage stochastic linear programs
Birge, J. R., & Louveaux, F. V. (1988) · European Journal of Operational Research · doi:10.1016/0377-2217(88)90159-2 · Cited by 540
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 Stochastic Demands: Properties and Solution Frameworks
Dror, M., Laporte, G., & Trudeau, P. (1989) · Transportation Science · doi:10.1287/trsc.23.3.166 · Cited by 286
Self-citationTwo exact algorithms for the distance‐constrained vehicle routing problem
Gilbert Laporte, A., Desrochers, M., & Nobert, Y. (1984) · Networks · doi:10.1002/net.3230140113 · Cited by 129
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
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-citationLi, X., Tian, P., & Leung, S. C. H. (2010) · International Journal of Production Economics · doi:10.1016/j.ijpe.2010.01.013 · Cited by 288
On-Time Last-Mile Delivery: Order Assignment with Travel-Time Predictors
Liu, S., He, L., & Max Shen, Z.-J. (2021) · Management Science · doi:10.1287/mnsc.2020.3741 · Cited by 268
A taxonomy for task allocation problems with temporal and ordering constraints
Nunes, E., Manner, M., Mitiche, H., & Gini, M. (2017) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.10.008 · Cited by 252
Metadata
- Authors
- Laporte, G., Louveaux, F., & Mercure, H.
- Venue
- Transportation Science
- Published
- 1992-08
- Volume
- 26
- Issue
- 3
- Pages
- 161-170
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2105972067
- Cited by
- 435
- References
- 6
- FWCI
- 12.33
- 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 Vehicle Routing Problem with Stochastic Travel Times. https://app.cochat.ai/papers/10.1287/trsc.26.3.161
- The paper
- Laporte, G., Louveaux, F., & Mercure, H. (1992). The Vehicle Routing Problem with Stochastic Travel Times. Transportation Science. https://doi.org/10.1287/trsc.26.3.161
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.
