Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
We consider the vehicle-routing problem with stochastic demands (VRPSD) under reoptimization. We develop and analyze a finite-horizon Markov decision process (MDP) formulation for the single-vehicle case and establish a partial characterization of the optimal policy. We also propose a heuristic solution methodology for our MDP, named partial reoptimization, based on the idea of restricting attention to a subset of all the possible states and computing an optimal policy on this restricted set of states. We discuss two families of computationally efficient partial reoptimization heuristics and illustrate their performance on a set of instances with up to and including 100 customers. Comparisons with an existing heuristic from the literature and a lower bound computed with complete knowledge of customer demands show that our best partial reoptimization heuristics outperform this heuristic and are on average no more than 10%–13% away from this lower bound, depending on the type of instances.
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
Markov decision processes: Discrete stochastic dynamic programming
Hazeghi, K., & Puterman, M. L. (1995) · Journal of the American Statistical Association · doi:10.2307/2291177 · Cited by 8,037 · cited 2×
“Dror, Laporte and Trudeau (1989) present a Markov decision process (MDP; Puterman 1994, Bertsekas 2000) formulation of the problem but do not discuss structural properties or attempt to numerically solve their model.”
BackgroundGlover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Cited by
The vehicle routing problem: State of the art classification and review
Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I. (2016) · Computers & Industrial Engineering · doi:10.1016/j.cie.2015.12.007 · Cited by 1,265
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
Dynamic vehicle routing problems: Three decades and counting
Psaraftis, H. N., Wen, M., & Kontovas, C. A. (2016) · Networks · doi:10.1002/net.21628 · Cited by 709
A survey on dynamic and stochastic vehicle routing problems
Ritzinger, U., Puchinger, J., & Hartl, R. F. (2016) · International Journal of Production Research · doi:10.1080/00207543.2015.1043403 · Cited by 443
Reusken, M., Laporte, G., Rohmer, S. U. K., & Cruijssen, F. (2024) · European Journal of Operational Research · doi:10.1016/j.ejor.2024.03.031 · Cited by 23
“…to the depot when capacity failure occurs in order to restore its capacity before resuming its route (Dror et al., 1989; Laporte et al., 2002; Secomandi & Margot, 2009), and the preventive return policy, where the route can be interrupted to travel to the depot to reset the capacity prior to…”
Metadata
- Authors
- Secomandi, N., & Margot, F.
- Venue
- Operations Research
- Published
- 2009-02
- Volume
- 57
- Issue
- 1
- Pages
- 214-230
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2138810186
- Cited by
- 171
- References
- 2
- FWCI
- 16.21
- 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.