Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands

DOI10.1287/opre.2019.1901zbMath1445.90008OpenAlexW3015299211MaRDI QIDQ5130499

Nicola Secomandi, Luca Bertazzi

Publication date: 4 November 2020

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2019.1901

zbMATH Keywords

vehicle routingworst-case analysisstochastic demandrestockinga priori routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (5)

Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand ⋮ A vehicle routing problem with multiple service agreements ⋮ Distortion risk measure under parametric ambiguity ⋮ Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut ⋮ An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands

Cites Work

• Stochastic vehicle routing: A comprehensive approach
• Stochastic vehicle routing
• Analysis of a rollout approach to sequencing problems with stochastic routing applications
• Worst-case demand distributions in vehicle routing
• Technical Note—Approximation Algorithms for VRP with Stochastic Demands
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• Computational Approaches to Stochastic Vehicle Routing Problems
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• A Priori Optimization
• Modeling uncertainty. An examination of stochastic theory, methods, and applications
• A Vehicle Routing Problem with Stochastic Demand

This page was built for publication: Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands