The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Stochastic Vehicle Routing with Random Travel Times
Abstract
We consider stochastic vehicle routing problems on a network with random travel and service times. A fleet of one or more vehicles is available to be routed through the network to service each node. Two versions of the model are developed based on alternative objective functions. We provide bounds on optimal objective function values and conditions under which reductions to simpler models can be made. Our solution method embeds a branch-and-cut scheme within a Monte Carlo sampling-based procedure.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Introduction to Stochastic Programming
Birge, J. R., & Louveaux, F. (2011) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/978-1-4614-0237-4 · Cited by 6,469
Loève, M. (1963) · Andalas University Repository (Andalas University) · Cited by 5,938
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
Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (2011) · Cited by 2,083
The Sample Average Approximation Method for Stochastic Discrete Optimization
Kleywegt, A. J., Shapiro, A., & Homem-de-Mello, T. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499363220 · Cited by 1,983
Sur les fonctions convexes et les inégalités entre les valeurs moyennes
Jensen, J. L. W. V. (1906) · Acta Mathematica · doi:10.1007/bf02418571 · Cited by 1,811
Prékopa, A. (1995) · Springer eBooks · doi:10.1007/978-94-017-3087-7 · Cited by 1,535
Solution of a Large-Scale Traveling-Salesman Problem
Dantzig, G. B., Fulkerson, R., & Johnson, S. M. (1954) · Journal of the Operations Research Society of America · doi:10.1287/opre.2.4.393 · Cited by 1,483
L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
Van Slyke, R. M., & Wets, R. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117061 · Cited by 1,281
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
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
Padberg, M., & Rinaldi, G. (1991) · SIAM Review · doi:10.1137/1033004 · Cited by 1,097
The integer L-shaped method for stochastic integer programs with complete recourse
Laporte, G., & Louveaux, F. V. (1993) · Operations Research Letters · doi:10.1016/0167-6377(93)90002-x · Cited by 778
Monte Carlo bounding techniques for determining solution quality in stochastic programs
Mak, W.-K., Morton, D. P., & Wood, R. K. (1999) · Operations Research Letters · doi:10.1016/s0167-6377(98)00054-6 · Cited by 704
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
Optimal Routing under Capacity and Distance Restrictions
Laporte, G., Nobert, Y., & Desrochers, M. (1985) · Operations Research · doi:10.1287/opre.33.5.1050 · Cited by 307
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
Economic decision-making : Games, econometrics and optimisation
(1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90346-w · Cited by 82
Computer-based modeling environments
Geoffrion, A. M. (1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90036-2 · Cited by 78
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
A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food
Osvald, A., & Stirn, L. Z. (2008) · Journal of Food Engineering · doi:10.1016/j.jfoodeng.2007.07.008 · Cited by 366
Planning of truck platoons: A literature review and directions for future research
Bhoopalam, A. K., Agatz, N., & Zuidwijk, R. (2018) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2017.10.016 · Cited by 298
Monte Carlo sampling-based methods for stochastic optimization
Homem-de-Mello, T., & Bayraksan, G. (2014) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2014.05.001 · Cited by 283
Vehicle routing problems with road‐network information: State of the art
Ben Ticha, H., Absi, N., Feillet, D., & Quilliot, A. (2018) · Networks · doi:10.1002/net.21808 · Cited by 51
Metadata
- Authors
- Kenyon, A. S., & Morton, D. P.
- Venue
- Transportation Science
- Published
- 2003-02
- Volume
- 37
- Issue
- 1
- Pages
- 69-82
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2001012897
- Cited by
- 300
- References
- 18
- FWCI
- 32.10
- 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
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.