An Improved Integer L-Shaped Method for the Vehicle Routing Problem with Stochastic Demands
From MaRDI portal
Publication:6203374
Recommendations
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- scientific article; zbMATH DE number 1452998
- An integer L-shaped method for the generalized vehicle routing problem with stochastic demands
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
Cited in
(7)- Vehicle routing with stochastic demand, service and waiting times -- the case of food bank collection problems
- A two-stage stochastic programming for the integrated emergency mobility facility allocation and road network design under uncertainty
- New formulations for the robust vehicle routing problem with time windows under demand and travel time uncertainty
- An evaluation of common modeling choices for the vehicle routing problem with stochastic demands
- Fifty years of operational research: 1972--2022
- A disaggregated integer L-shaped method for stochastic vehicle routing problems with monotonic recourse
- A hybrid framework for multi-depot vehicle routing under stochastic demand: integrating adaptive redispatching with joint distribution
This page was built for publication: An Improved Integer L-Shaped Method for the Vehicle Routing Problem with Stochastic Demands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203374)