An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands

DOI10.1287/opre.50.3.415.7751zbMath1163.90773OpenAlexW2023482164WikidataQ96171796 ScholiaQ96171796MaRDI QIDQ3635101

François V. Louveaux, Luc van Hamme, Gilbert Laporte

Publication date: 3 July 2009

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

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items

A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service, Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows, Periodic supply vessel planning under demand and weather uncertainty, A solution method for a two-dispatch delivery problem with stochastic customers, A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem, An arc-exchange decomposition method for multistage dynamic networks with random arc capacities, On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty, On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming, BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems, The mixed capacitated general routing problem under uncertainty, A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands, Stochastic Planning and Scheduling with Logic-Based Benders Decomposition, The capacitated vehicle routing problem with evidential demands, Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events, Satisficing measure approach for vehicle routing problem with time windows under uncertainty, A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times, On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows, The efficacy of exclusive territory assignments to delivery vehicle drivers, Exact Algorithms for the Chance-Constrained Vehicle Routing Problem, Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling, The vehicle rescheduling problem, A two-stage approach to the orienteering problem with stochastic weights, Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands, A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands, Faster rollout search for the vehicle routing problem with stochastic demands and restocking, Vehicle routing with probabilistic capacity constraints, Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands, A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands, AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES, An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects, Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry, On a stochastic sequencing and scheduling problem, On the enrouting protocol problem under uncertainty, A multi-space sampling heuristic for the vehicle routing problem with stochastic demands, Fuzzy green vehicle routing problem with simultaneous pickup – delivery and time windows, Short-term liner ship fleet planning with container transshipment and uncertain container shipment demand, Resilient route design for collection of material from suppliers with split deliveries and stochastic demands, A vehicle routing problem with multiple service agreements, Partial-route inequalities for the multi-vehicle routing problem with stochastic demands, A light‐touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique, The Vehicle Routing Problem with Stochastic Demands and Split Deliveries, Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints, Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures, Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems, 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, Integrated supply chain planning under uncertainty using an improved stochastic approach, Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand, A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration, The dynamic bowser routing problem, On the computational complexity of the probabilistic traveling salesman problem with deadlines, An Approximation-Based Approach for Chance-Constrained Vehicle Routing and Air Traffic Control Problems, Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs, A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations, Scheduled service network design with resource management for two-tier multimodal city logistics, A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands, AN ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS, An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy, A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty, An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays, The capacitated vehicle routing problem with stochastic demands and time windows, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands, The million-variable ``march for stochastic combinatorial optimization, Self-imposed time windows in vehicle routing problems, Stochastic set packing problem, Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints, Home service routing and appointment scheduling with stochastic service times, Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables, A selective newsvendor approach to order management, Variable neighborhood search for the stochastic and dynamic vehicle routing problem, Exact algorithms for the chance-constrained vehicle routing problem, A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems, Liner ship bunkering and sailing speed planning with uncertain demand, Mitigating Information Asymmetry in Liver Allocation, An approximate dynamic programming approach for the vehicle routing problem with stochastic demands, Improving the Integer L-Shaped Method, Robust optimization for the vehicle routing problem with multiple deliverymen, A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem, A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands, A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling, Sustainable multi-depot emergency facilities location-routing problem with uncertain information, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers, An algorithm for two-stage stochastic mixed-integer nonlinear convex problems, A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs