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.90782OpenAlexW2062245133MaRDI 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
Related Items
Reference policies for non-myopic sequential network design and timing problems ⋮ A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem ⋮ Dynamic vehicle routing using an improved variable neighborhood search algorithm ⋮ A new approximate dynamic programming algorithm based on an actor–critic framework for optimal control of alkali–surfactant–polymer flooding ⋮ A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order ⋮ On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows ⋮ Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling ⋮ 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 ⋮ Real-time management of transportation disruptions in forestry ⋮ Robust optimisation approach for vehicle routing problems with uncertainty ⋮ Deep policy dynamic programming for vehicle routing problems ⋮ Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands ⋮ Lookahead approximate dynamic programming for stochastic aircraft maintenance check scheduling optimization ⋮ Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands ⋮ An online stochastic algorithm for a dynamic nurse scheduling problem ⋮ 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 ⋮ Distributed stochastic multi-vehicle routing in the Euclidean plane with no communications ⋮ The in‐house logistics routing problem ⋮ Minimum and worst-case performance ratios of rollout algorithms ⋮ Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles ⋮ A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs ⋮ Fitting piecewise linear continuous functions ⋮ A two-stage method for UCAV TF/TA path planning based on approximate dynamic programming ⋮ An inverse robust optimisation approach for a class of vehicle routing problems under uncertainty ⋮ Vehicle routing problem based on a fuzzy customer clustering approach for logistics network optimization ⋮ Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review ⋮ A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem
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
This page was built for publication: An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
