An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
From MaRDI portal
Publication:3635101
Recommendations
- 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
- Vehicle routing with stochastic demands and restricted failures
- New optimality cuts for a single-vehicle stochastic routing problem
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
Cited in
(only showing first 100 items - show all)- A general algorithm for solving two-stage stochastic mixed 0-1 first-stage problems
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- 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
- Stochastic vehicle routing with modified savings algorithm
- Models and exact solutions for a class of stochastic location-routing problems
- The capacitated vehicle routing problem with evidential 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
- Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
- The dynamic bowser routing problem
- A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
- Exact algorithms for the chance-constrained vehicle routing problem
- Short-term liner ship fleet planning with container transshipment and uncertain container shipment demand
- Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems
- An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
- Self-imposed time windows in vehicle routing problems
- Home service routing and appointment scheduling with stochastic service times
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
- Improved approximation algorithms for cumulative VRP with stochastic demands
- Scheduled service network design with resource management for two-tier multimodal city logistics
- Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables
- Liner ship bunkering and sailing speed planning with uncertain demand
- Robust optimization for the vehicle routing problem with multiple deliverymen
- 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
- A solution method for a two-dispatch delivery problem with stochastic customers
- The efficacy of exclusive territory assignments to delivery vehicle drivers
- A recourse approach for the capacitated vehicle routing problem with evidential demands
- On the computational complexity of the probabilistic traveling salesman problem with deadlines
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
- The million-variable ``march for stochastic combinatorial optimization
- An algorithm for two-stage stochastic mixed-integer nonlinear convex 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
- 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
- An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects
- Resilient route design for collection of material from suppliers with split deliveries and stochastic demands
- Improving the integer L-shaped method
- 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
- Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints
- Exact algorithms for the chance-constrained vehicle routing problem
- scientific article; zbMATH DE number 4172715 (Why is no real title available?)
- 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
- An integer L-shaped method for the generalized vehicle routing problem with stochastic demands
- An approximation-based approach for chance-constrained vehicle routing and air traffic control problems
- 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
- Mitigating Information Asymmetry in Liver Allocation
- A selective newsvendor approach to order management
- 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 stochastic demands and restricted failures
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
- Fuzzy green vehicle routing problem with simultaneous pickup – delivery and time windows
- scientific article; zbMATH DE number 1452998 (Why is no real title available?)
- Stochastic planning and scheduling with logic-based Benders decomposition
- Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events
- A stochastic integer programming approach to air traffic scheduling and operations
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- AN ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS
- The capacitated vehicle routing problem with stochastic demands and time windows
- A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- Periodic supply vessel planning under demand and weather uncertainty
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem
- A Vehicle Routing Problem with Stochastic Demand
- A vehicle routing problem with multiple service agreements
- 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
- 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
- An Improved Integer L-Shaped Method for the Vehicle Routing Problem with Stochastic Demands
- Integrated supply chain planning under uncertainty using an improved stochastic approach
- New exact algorithm for the integrated train timetabling and rolling stock circulation planning problem with stochastic demand
- Recourse strategy for the routing problem of mobile parcel lockers with time windows under uncertain demands
- Vehicle routing with stochastic demand, service and waiting times -- the case of food bank collection problems
- A disaggregated integer L-shaped method for the bike sharing rebalancing problem with stochastic demands
- Models and algorithms for the time window assignment traveling salesperson problem with stochastic travel times
- Capacitated hub location routing problem with time windows and stochastic demands for the design of intra-city express systems
- 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
- Stochastic vehicle routing with delivery choice
- Meal delivery routing problem with stochastic meal preparation times and customer locations
This page was built for publication: An Integer L-Shaped Algorithm for the Capacitated 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 Q3635101)
