Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
From MaRDI portal
Publication:1579026
DOI10.1016/S0305-0548(99)00146-XzbMath0962.90010WikidataQ56058028 ScholiaQ56058028MaRDI QIDQ1579026
Publication date: 30 January 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Stochastic programming (90C15) Combinatorial optimization (90C27) Dynamic programming (90C39) Traffic problems in operations research (90B20)
Related Items (28)
Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation ⋮ 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 ⋮ Travel time reliability in vehicle routing and scheduling with time windows ⋮ Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand ⋮ Minimum and worst-case performance ratios of rollout algorithms ⋮ A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs ⋮ A fuzzy-based customer classification method for demand-responsive logistical distribution operations. ⋮ Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand ⋮ Approximate receding horizon approach for Markov decision processes: average reward case ⋮ A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations ⋮ Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering ⋮ Solving the vehicle routing problem with stochastic demands using the cross-entropy method ⋮ The capacitated vehicle routing problem with stochastic demands and time windows ⋮ A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands ⋮ Hybrid metaheuristics for the vehicle routing problem with stochastic demands ⋮ Dynamic programming and suboptimal control: a survey from ADP to MPC ⋮ New Rollout Algorithms for Combinatorial Optimization Problems ⋮ Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns ⋮ 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 self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem ⋮ A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling ⋮ Neural networks in business: Techniques and applications for the operations researcher ⋮ Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers ⋮ Parallelization strategies for rollout algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Stochastic vehicle routing: A comprehensive approach
- Stochastic vehicle routing with modified savings algorithm
- Models and exact solutions for a class of stochastic location-routing problems
- The stochastic vehicle routing problem revisited
- Stochastic vehicle routing
- Planning models for freight transportation
- Rollout algorithms for stochastic scheduling problems
- Dynamic vehicle routing: Status and prospects
- Rollout algorithms for combinatorial optimization
- Stochastic Vehicle Routing Problem with Restocking
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- Vehicle routing with stochastic demands and restricted failures
- Stochastic and dynamic vehicle routing with general demand and interarrival time distributions
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Computational Approaches to Stochastic Vehicle Routing Problems
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
