Papers › Recent Advances in Vehicle Routing with Stochastic Demands: Bayesian Learning for...
Recent Advances in Vehicle Routing with Stochastic Demands: Bayesian Learning for Correlated Demands and Elementary Branch-Price-and-Cut
Alexandre M. Florio, Michel Gendreau, Richard F. Hartl, Stefan Minner, Thibaut Vidal
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We consider the vehicle routing problem with stochastic demands (VRPSD), a stochastic variant of the well-known VRP in which demands are only revealed upon arrival of the vehicle at each customer. Motivated by the significant recent progress on VRPSD research, we begin this paper by summarizing the key new results and methods for solving the problem. In doing so, we discuss the main challenges associated with solving the VRPSD under the chance-constraint and the restocking-based perspectives. Once we cover the current state-of-the-art, we introduce two major methodological contributions. First, we present a branch-price-and-cut (BP&C) algorithm for the VRPSD under optimal restocking. The method, which is based on the pricing of elementary routes, compares favorably with previous algorithms and allows the solution of several open benchmark instances. Second, we develop a demand model for dealing with correlated customer demands. The central concept in this model is the "external factor", which represents unknown covariates that affect all demands. We present a Bayesian-based, iterated learning procedure to refine our knowledge about the external factor as customer demands are revealed. This updated knowledge is then used to prescribe optimal replenishment decisions under demand correlation. Computational results demonstrate the efficiency of the new BP&C method and show that cost savings above 10% may be achieved when restocking decisions take account of demand correlation. Lastly, we motivate a few research perspectives that, as we believe, should shape future research on the VRPSD.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections