Abstract
The Capacitated Vehicle Routing Problem (CVRP) is a classical combinatorial optimization problem that aims to serve a set of customers, using a set of identical vehicles, satisfying the vehicle capacities, and minimizing the total traveling distance. Among the possible approaches to extend the CVRP for handling uncertain demands, we highlight the robust optimization with budgeted uncertainty, and chance-constrained optimization. Another simpler and often omitted option is to apply the deterministic CVRP model over augmented demands in such a way to reduce the capacity violation probability. In this paper, we propose a suitable way to adjust the input data of both the deterministic CVRP and the robust CVRP with budgeted uncertainty so that the corresponding output approximates the chance-constrained CVRP for the case of independently normally distributed demands. In order to test our approach, we present quite extensive experiments showing that it leads to very small deviations with respect to the optimal chance-constrained solutions, and that the robust model brings significant benefits with respect to the deterministic one. In order to optimally solve the proposed chance-constrained benchmark instances, we also introduce a new technique to tighten a family of known inequalities for this problem.
Similar content being viewed by others
References
Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manage Sci 6(1):80–91
Toth P, Vigo D (2002) The vehicle routing problem. SIAM, USA
Cordeau J-F, Laporte G, Savelsbergh M, Vigo D (2007) 6. Vehicle Routing. transportation, handbooks in operations research and management science, vol. 14, pp. 195–224. Elsevier, USA
Golden BL, Raghavan S, Wasil EA (2008) The vehicle routing problem: latest advances and new challenges, vol 43. Springer, USA
Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43(4):408–416
Baldacci R, Toth P, Vigo D (2010) Exact algorithms for routing problems under vehicle capacity constraints. Ann Oper Res 175(1):213–245
Toth P, Vigo D (2014) Vehicle routing: problems, methods, and applications, 2nd edn. Society for Industrial and Applied Mathematics, USA
Uchoa E, Pecin D, Pessoa A, Poggi M, Vidal T, Subramanian A (2017) New benchmark instances for the capacitated vehicle routing problem. Eur J Oper Res 257(3):845–858
Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2020) A generic exact solver for vehicle routing and related problems. Math Program 183(1):483–523
Shapiro A, Dentcheva D, Ruszczynski A (2009) Lectures on stochastic programming: modeling and theory, mos-siam ser. Optim, SIAM, Philadelphia
Ben-Tal A, El Ghaoui L, Nemirovski AS (2009) Robust optimization. Princeton Series in Applied Mathematics. Princeton University Press, Princeton, New Jersey, USA
Pessoa AA, Poss M, Sadykov R, Vanderbeck F (2021) Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty. Oper Res 69(3):739–754
Dinh T, Fukasawa R, Luedtke J (2018) Exact algorithms for the chance-constrained vehicle routing problem. Math Program 172(1–2):105–138
Ghaoui LE (2008) Lecture 24: Robust optimization: chance Constraints. In course EE 227A: convex optimization and applications, University of California, Berkeley, CA, USA
Pecin D, Pessoa A, Poggi M, Uchoa E (2017) Improved branch-cut-and-price for capacitated vehicle routing. Math Program Comput 9(1):61–100
Fukasawa R, Longo H, Lysgaard J, De Aragão MP, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program 106(3):491–511
Laporte G, Louveaux F, Mercure H (1989) Models and exact solutions for a class of stochastic location-routing problems. Eur J Oper Res 39(1):71–78
Lourenço HR, Martin OC, Stützle T (2002) Iterated local search. In: handbook of metaheuristics, pp. 321–353. Kluwer Academic Publishers, Norwell, MA
Subramanian A (2012) Heuristic, exact and hybrid approaches for vehicle routing problems. universidad federal fluminense. PhD. thesis, Tesis Doctoral. Niteroi, 13
Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581
Golden BL, Stewart W (1978) Vehicle routing with probabilistic demands. In: computer science and statistics: tenth annual symposium on the interface, NBS Special Publication, vol. 503, pp. 252–259
Ghosal S, Wiesemann W (2020) The distributionally robust chance-constrained vehicle routing problem. Oper Res 68(3):716–732
Acknowledgements
This research was partially supported by CNPq, grant 306033/2019-4.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interest
The authors declare that they have no conflict of interest that may have influenced the results reported in this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Thiebaut, K., Pessoa, A. Approximating the chance-constrained capacitated vehicle routing problem with robust optimization. 4OR-Q J Oper Res 21, 513–531 (2023). https://doi.org/10.1007/s10288-022-00523-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-022-00523-3