A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands

DOI10.1287/opre.49.5.796.10608zbMath1163.90373OpenAlexW2091932422MaRDI QIDQ3635037

Nicola Secomandi

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.49.5.796.10608

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (41)

Reference policies for non-myopic sequential network design and timing problems ⋮ A solution method for a two-dispatch delivery problem with stochastic customers ⋮ Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming ⋮ 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 ⋮ Approximate policy optimization and adaptive control in regression models ⋮ Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation ⋮ The vehicle rescheduling problem ⋮ Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands ⋮ Faster rollout search for the vehicle routing problem with stochastic demands and restocking ⋮ A multi-space sampling heuristic for the vehicle routing problem with stochastic demands ⋮ A robust optimization approach to dispatching technicians under stochastic service times ⋮ 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 ⋮ Off-line approximate dynamic programming for the vehicle routing problem with a highly variable customer basis and stochastic demands ⋮ A vehicle routing problem with multiple service agreements ⋮ Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach ⋮ Dynamic priority rules for combining on-demand passenger transportation and transportation of goods ⋮ Minimum and worst-case performance ratios of rollout algorithms ⋮ Routing Courier Delivery Services with Urgent Demand ⋮ A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs ⋮ Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand ⋮ Managing mobile production-inventory systems influenced by a modulation process ⋮ An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy ⋮ Solving the vehicle routing problem with stochastic demands using the cross-entropy method ⋮ A two-stage vehicle routing model for large-scale bioterrorism emergencies ⋮ Hybrid metaheuristics for the vehicle routing problem with stochastic demands ⋮ Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints ⋮ Dynamic programming and suboptimal control: a survey from ADP to MPC ⋮ Variable neighborhood search for the stochastic and dynamic vehicle routing problem ⋮ Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns ⋮ AN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDS ⋮ A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ 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 ⋮ 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 ⋮ Opportunities for reinforcement learning in stochastic dynamic vehicle routing ⋮ Average-case performance of rollout algorithms for knapsack problems ⋮ Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers

This page was built for publication: A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands