An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands

DOI10.1016/j.ejor.2022.11.040OpenAlexW4310033065MaRDI QIDQ6167539

Pedro Augusto Munari, Reinaldo Morabito, Jonathan De La Vega, Fernando Ordóñez, Michel Gendreau

Publication date: 10 July 2023

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

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

zbMATH Keywords

time windowsroutingstochastic demandinteger L-shaped algorithmfixed rule-based policy

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

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 vehicle routing problem with simultaneous delivery and stochastic pickup

Cites Work

• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
• A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
• Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
• The capacitated vehicle routing problem with stochastic demands and time windows
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• New optimality cuts for a single-vehicle stochastic routing problem
• Faster rollout search for the vehicle routing problem with stochastic demands and restocking
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
• Exact algorithms for the chance-constrained vehicle routing problem
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
• Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands
• Robust optimization for the vehicle routing problem with multiple deliverymen
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• The mixed capacitated general routing problem under uncertainty
• Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• Stochastic Vehicle Routing Problem with Restocking
• The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
• Vehicle Routing
• Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• A new approach to the maximum-flow problem
• A note on determining operating strategies for probabilistic vehicle routing
• 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
• 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
• Benchmarking optimization software with performance profiles.
• A Vehicle Routing Problem with Stochastic Demand