An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy

DOI10.1016/j.ejor.2018.07.039zbMath1403.90170OpenAlexW2886856082WikidataQ115044602 ScholiaQ115044602MaRDI QIDQ1991276

Majid Salavati-Khoshghalb, Michel Gendreau, Ola Jabali, Walter Rei

Publication date: 30 October 2018

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.07.039

zbMATH Keywords

routingstochastic demandsinteger \(L\)-shaped algorithmlower bounding functionalsoptimal restocking policy

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

Related Items

Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands, A concise guide to existing and emerging vehicle routing problem variants, Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand, Resilient route design for collection of material from suppliers with split deliveries and stochastic demands, A vehicle routing problem with multiple service agreements, Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut, Optimizing integrated aircraft assignment and turnaround handling, The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands, An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup, An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands, Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products

Uses Software

• VRP
• CVRPSP

Cites Work

• Unnamed Item
• A branch-cut-and-price algorithm 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
• Stochastic vehicle routing with modified savings algorithm
• New optimality cuts for a single-vehicle stochastic routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• The Truck Dispatching Problem
• Stochastic Vehicle Routing Problem with Restocking
• Vehicle Routing
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• A note on determining operating strategies for probabilistic vehicle routing
• Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• A Priori Optimization