A variable neighborhood search based algorithm for finite-horizon Markov decision processes
From MaRDI portal
Publication:613296
DOI10.1016/j.amc.2010.09.018zbMath1202.90269OpenAlexW2087664232MaRDI QIDQ613296
Nenad Mladenović, Qiu Hong Zhao, Jack Brimberg
Publication date: 20 December 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.09.018
metaheuristicsfinite horizonvariable neighborhood search (VNS)Markov decision processes (MDPs)variable action set
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variable neighbourhood search: methods and applications
- Attraction probabilities in variable neighborhood search
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search
- A decomposition algorithm for limiting average Markov decision problems.
- Optimization of the stochastic dynamic production cycling problem by a genetic algorithm.
- A sparse sampling algorithm for near-optimal planning in large Markov decision processes
- An Evolutionary Random Policy Search Algorithm for Solving Markov Decision Processes
- The Linear Programming Approach to Approximate Dynamic Programming
- Adaptive aggregation methods for infinite horizon dynamic programming
- Using Randomization to Break the Curse of Dimensionality
- Evolutionary policy iteration for solving Markov decision processes
- An Asymptotically Efficient Simulation-Based Algorithm for Finite Horizon Stochastic Dynamic Programming
- Recursive Learning Automata Approach to Markov Decision Processes
- An Adaptive Sampling Algorithm for Solving Markov Decision Processes
- Letter to the Editor—A Test for Suboptimal Actions in Markovian Decision Problems
- A survey of computational complexity results in systems and control
This page was built for publication: A variable neighborhood search based algorithm for finite-horizon Markov decision processes
