A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
From MaRDI portal
Publication:1698902
DOI10.1016/J.EJOR.2016.09.040zbMATH Open1380.90276OpenAlexW2528374652MaRDI QIDQ1698902FDOQ1698902
Authors: Justin C. Goodson, Barrett W. Thomas, Jeffrey W. Ohlmann 
Publication date: 16 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.09.040
Recommendations
- Minimum and worst-case performance ratios of rollout algorithms
- Rollout algorithms for combinatorial optimization
- Average-case performance of rollout algorithms for knapsack problems
- Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits
- Analysis of a rollout approach to sequencing problems with stochastic routing applications
Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Stochastic programming (90C15)
Cites Work
- Title not available (Why is that?)
- Approximate dynamic programming. Solving the curses of dimensionality
- Dynamic programming and optimal control. Vol. 1.
- The Dynamic and Stochastic Knapsack Problem with Deadlines
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- Rollout algorithms for combinatorial optimization
- An approximate dynamic programming approach to multidimensional knapsack problems
- Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits
- Rollout algorithms for stochastic scheduling problems
- A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
- A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
- 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
- Dynamic programming and suboptimal control: a survey from ADP to MPC
- The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
- A rollout metaheuristic for job shop scheduling problems
- Hybrid rollout approaches for the job shop scheduling problem
- Minimum and worst-case performance ratios of rollout algorithms
- Parallelization strategies for rollout algorithms
- Computational Approaches to Stochastic Vehicle Routing Problems
- Simulation-based algorithms for Markov decision processes
- Looking ahead with the pilot method
- Title not available (Why is that?)
- New Rollout Algorithms for Combinatorial Optimization Problems
- Average-case performance of rollout algorithms for knapsack problems
- Title not available (Why is that?)
Cited In (21)
- Rollout-based routing strategies with embedded prediction: a fish trawling application
- Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems
- A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems
- Minimum and worst-case performance ratios of rollout algorithms
- Value function approximation for dynamic multi-period vehicle routing
- Managing mobile production-inventory systems influenced by a modulation process
- The dynamic dispatch waves problem for same-day delivery
- Meso-parametric value function approximation for dynamic customer acceptances in delivery routing
- Faster rollout search for the vehicle routing problem with stochastic demands and restocking
- Multi-period technician scheduling with experience-based service times and stochastic customers
- Expectation analysis for bounding solutions of the 0-1 knapsack problem
- Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing
- Combined maintenance and routing optimization for large-scale sewage cleaning
- Planning horizons based proactive rescheduling for stochastic resource-constrained project scheduling problems
- Analysis of a rollout approach to sequencing problems with stochastic routing applications
- Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach
- Adaptive spatial designs minimizing the integrated Bernoulli variance in spatial logistic regression models -- with an application to benthic habitat mapping
- Opportunities for reinforcement learning in stochastic dynamic vehicle routing
- Rollout algorithms for combinatorial optimization
- Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
- Analysis of deterministic control and its improvements for an inventory problem with multiproduct batch differentiation
This page was built for publication: A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1698902)
