The DOI matches its Crossref record.
A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty
Abstract
In this paper we introduce a robust optimization approach to solve the Vehicle Routing Problem (VRP) with demand uncertainty. This approach yields routes that minimize transportation costs while satisfying all demands in a given bounded uncertainty set. We show that for the Miller–Tucker–Zemlin formulation of the VRP and specific uncertainty sets, solving for the robust solution is no more difficult than solving a single deterministic VRP. Our computational results on benchmark instances and on families of clustered instances show that the robust solution can protect from unmet demand while incurring a small additional cost over deterministic optimal routes. This is most pronounced for clustered instances under moderate uncertainty, where remaining vehicle capacity is used to protect against variations within each cluster at a small additional cost. We compare the robust optimization model with classic stochastic VRP models for this problem to illustrate the differences and similarities between them. We also observe that the robust solution amounts to a clever management of the remaining vehicle capacity compared to uniformly and non-uniformly distributing this slack over the vehicles.
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
Cited by
Recent advances in robust optimization: An overview
Gabrel, V., Murat, C., & Thiele, A. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.09.036 · Cited by 912
The electric vehicle routing problem with energy consumption uncertainty
Pelletier, S., Jabali, O., & Laporte, G. (2019) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2019.06.006 · Cited by 260
Robust earth observation satellite scheduling with uncertainty of cloud coverage
Wang, X., Song, G., Leus, R., & Han, C. (2020) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2019.2947978 · Cited by 70
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
Metadata
- Authors
- Sungur, I., Ordóñez, F., & Dessouky, M.
- Venue
- IIE Transactions
- Publisher
- Informa UK Limited
- Published
- 2008-03-10
- Volume
- 40
- Issue
- 5
- Pages
- 509-523
- ISSN
- 0740-817X (ISSN-L)
- 1545-8830
- OpenAlex
- W2023964406
- Cited by
- 243
- References
- 0
- FWCI
- 23.30
- 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: A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. https://app.cochat.ai/papers/10.1080/07408170701745378
- The paper
- Sungur, I., Ordóñez, F., & Dessouky, M. (2008). A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Transactions. https://doi.org/10.1080/07408170701745378
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.