Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut

DOI10.1016/j.ejor.2022.10.045arXiv2302.02538MaRDI QIDQ6106761

Stefan Minner, Richard F. Hartl, Thibaut Vidal, Alexandre M. Florio, Michel Gendreau

Publication date: 3 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.02538

zbMATH Keywords

column generationBayesian inferenceroutingoptimal restocking

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

An online reinforcement learning approach to charging and order-dispatching optimization for an e-hailing electric vehicle fleet

Cites Work

• Unnamed Item
• Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Models and exact solutions for a class of stochastic location-routing problems
• Faster rollout search for the vehicle routing problem with stochastic demands and restocking
• Vehicle routing with probabilistic capacity constraints
• New benchmark instances for the capacitated vehicle routing problem
• Exact algorithms for the chance-constrained vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
• Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
• Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method
• Study on the optimization of urban emergency supplies distribution paths for epidemic outbreaks
• Vehicle Routing
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• A First Course in Bayesian Statistical Methods
• A note on determining operating strategies for probabilistic vehicle routing
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty
• Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands
• The Distributionally Robust Chance-Constrained Vehicle Routing Problem
• A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
• An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands