Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
From MaRDI portal
Publication:5188995
DOI10.1287/opre.1080.0520zbMath1181.90043OpenAlexW2138810186MaRDI QIDQ5188995
Margot, François, Nicola Secomandi
Publication date: 6 March 2010
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/607faeb671b0d87d85a42168efb82b08f57ce181
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows, A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility, A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order, Satisficing measure approach for vehicle routing problem with time windows under uncertainty, On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows, Exact Algorithms for the Chance-Constrained Vehicle Routing Problem, Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands, A branch-and-price approach for a multi-period vehicle routing problem, Faster rollout search for the vehicle routing problem with stochastic demands and restocking, Real-time management of transportation disruptions in forestry, Heuristics for dynamic and stochastic routing in industrial shipping, Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry, A multi-space sampling heuristic for the vehicle routing problem with stochastic demands, Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands, Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand, A vehicle routing problem with multiple service agreements, Partial-route inequalities for the multi-vehicle routing problem with stochastic demands, Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach, 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, Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand, An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy, Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports, The capacitated vehicle routing problem with stochastic demands and time windows, SINGLE VEHICLE ROUTING PROBLEMS WITH A PREDEFINED CUSTOMER ORDER, UNIFIED LOAD AND STOCHASTIC DISCRETE DEMANDS, A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands, Self-imposed time windows in vehicle routing problems, The dynamic dispatch waves problem for same-day delivery, Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance, Variable neighborhood search for the stochastic and dynamic vehicle routing problem, Exact algorithms for the chance-constrained vehicle routing problem, An approximate dynamic programming approach for the vehicle routing problem with stochastic demands, Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review, Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty, A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem, Dynamic traveling salesman problem with stochastic release dates, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers, Learning to Approximate Industrial Problems by Operations Research Classic Problems
Uses Software
