The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
Abstract
In 1991, D. J. Bertsimas and G. van Ryzin introduced and analyzed a model for stochastic and dynamic vehicle routing in which a single, uncapacitated vehicle traveling at a constant velocity in a Euclidean region must service demands whose time of arrival, location and on-site service are stochastic. The objective is to find a policy to service demands over an infinite horizon that minimizes the expected system time (wait plus service) of the demands. This paper extends our analysis in several directions. First, we analyze the problem of m identical vehicles with unlimited capacity and show that in heavy traffic the system time is reduced by a factor of 1/m 2 over the single-server case. One of these policies improves by a factor of two on the best known system time for the single-server case. We then consider the case in which each vehicle can serve at most q customers before returning to a depot. We show that the stability condition in this case depends strongly on the geometry of the region. Several policies that have system times within a constant factor of the optimum in heavy traffic are proposed. Finally, we discuss extensions to mixed travel cost and system time objectives.
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
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
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
Karp, R. M. (1977) · Mathematics of Operations Research · doi:10.1287/moor.2.3.209 · Cited by 439
Bounds and Heuristics for Capacitated Routing Problems
Haimovich, M., & Kan, A. H. G. R. (1985) · Mathematics of Operations Research · doi:10.1287/moor.10.4.527 · Cited by 363
Cited by
Otto, A., Agatz, N., Campbell, J., Golden, B., & Pesch, E. (2018) · Networks · doi:10.1002/net.21818 · Cited by 985
“Because service times of such surveillance requests are often uncertain, a variant of the m-vehicle dynamic traveling repairman problem often arises [28, 29]; see Bullo et al.”
BackgroundDynamic 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
Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies
Ghiani, G., Guerriero, F., Laporte, G., & Musmanno, R. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00915-3 · Cited by 350
Chapter 3 Stochastic and dynamic networks and routing
Powell, W. B., Jaillet, P., & Odoni, A. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80107-0 · Cited by 334
Real-Time Multivehicle Truckload Pickup and Delivery Problems
Yang, J., Jaillet, P., & Mahmassani, H. (2004) · Transportation Science · doi:10.1287/trsc.1030.0068 · Cited by 280
Metadata
- Authors
- Bertsimas, D. J., & van Ryzin, G.
- Venue
- Operations Research
- Published
- 1993-02
- Volume
- 41
- Issue
- 1
- Pages
- 60-76
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W1971739135
- Cited by
- 274
- References
- 3
- FWCI
- 20.07
- 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.