An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
From MaRDI portal
Publication:1027533
DOI10.1016/j.ejor.2008.03.023zbMath1163.90782MaRDI QIDQ1027533
Publication date: 30 June 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.03.023
90C39: Dynamic programming
Related Items
Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands, Minimum and worst-case performance ratios of rollout algorithms, Fitting piecewise linear continuous functions, Dynamic vehicle routing using an improved variable neighborhood search algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Models and exact solutions for a class of stochastic location-routing problems
- The stochastic vehicle routing problem revisited
- Stochastic vehicle routing
- New optimality cuts for a single-vehicle stochastic routing problem
- On the capacitated vehicle routing problem
- Analysis of a rollout approach to sequencing problems with stochastic routing applications
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
- Rollout algorithms for stochastic scheduling problems
- Dynamic vehicle routing: Status and prospects
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method
- Rollout algorithms for combinatorial optimization
- Stochastic Vehicle Routing Problem with Restocking
- Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints
- Sensitivity Analysis of a Dynamic Fleet Management Model Using Approximate Dynamic Programming
- A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- The Linear Programming Approach to Approximate Dynamic Programming
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- The Stochastic Inventory Routing Problem with Direct Deliveries
- Computational Approaches to Stochastic Vehicle Routing Problems
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- Approximate Dynamic Programming
- A Price-Directed Approach to Stochastic Inventory/Routing
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Vehicle Routing Problem with Stochastic Demand
