IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v324y2025i1p155-167.html
   My bibliography  Save this article

Solving Markov decision processes via state space decomposition and time aggregation

Author

Listed:
  • Alexandre, Rodrigo e Alvim
  • Fragoso, Marcelo D.
  • Filho, Virgílio J.M. Ferreira
  • Arruda, Edilson F.

Abstract

Although there are techniques to address large scale Markov decision processes (MDP), a computationally adequate solution of the so-called curse of dimensionality still eludes, in many aspects, a satisfactory treatment. In this paper, we advance in this issue by introducing a novel multi-subset partitioning scheme to allow for a distributed evaluation of the MDP, aiming to accelerate convergence and enable distributed policy improvement across the state space, whereby the value function and the policy improvement step can be performed independently, one subset at a time. The scheme’s innovation hinges on a design that induces communication properties that allow us to evaluate time aggregated trajectories via absorption analysis, thereby limiting the computational effort. The paper introduces and proves the convergence of a class of distributed time aggregation algorithms that combine the partitioning scheme with two-phase time aggregation to distribute the computations and accelerate convergence. In addition, we make use of Foster’s sufficient conditions for stochastic stability to develop a new theoretical result which underpins a partition design that guarantees that large regions of the state space are rarely visited and have a marginal effect on the system’s performance. This enables the design of approximate algorithms to find near-optimal solutions to large scale systems by focusing on the most visited regions of the state space. We validate the approach in a series of experiments featuring production and inventory and queuing applications. The results highlight the potential of the proposed algorithms to rapidly approach the optimal solution under different problem settings.

Suggested Citation

  • Alexandre, Rodrigo e Alvim & Fragoso, Marcelo D. & Filho, Virgílio J.M. Ferreira & Arruda, Edilson F., 2025. "Solving Markov decision processes via state space decomposition and time aggregation," European Journal of Operational Research, Elsevier, vol. 324(1), pages 155-167.
  • Handle: RePEc:eee:ejores:v:324:y:2025:i:1:p:155-167
    DOI: 10.1016/j.ejor.2025.01.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725000803
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2025.01.037?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Arruda, E.F. & Fragoso, M.D., 2015. "Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm," European Journal of Operational Research, Elsevier, vol. 240(3), pages 697-705.
    2. Xu, Jianyu & Liu, Bin & Zhao, Xiujie & Wang, Xiao-Lin, 2024. "Online reinforcement learning for condition-based group maintenance using factored Markov decision processes," European Journal of Operational Research, Elsevier, vol. 315(1), pages 176-190.
    3. Oleksandr Shlakhter & Chi-Guhn Lee & Dmitry Khmelev & Nasser Jaber, 2010. "Acceleration Operators in the Value Iteration Algorithms for Markov Decision Processes," Operations Research, INFORMS, vol. 58(1), pages 193-202, February.
    4. Malekipirbazari, Milad, 2025. "Optimizing sequential decision-making under risk: Strategic allocation with switching penalties," European Journal of Operational Research, Elsevier, vol. 321(1), pages 160-176.
    5. Arruda, Edilson F. & Ourique, Fabrício O. & LaCombe, Jason & Almudevar, Anthony, 2013. "Accelerating the convergence of value iteration by using partial transition functions," European Journal of Operational Research, Elsevier, vol. 229(1), pages 190-198.
    6. Martin L. Puterman & Moon Chirl Shin, 1982. "Action Elimination Procedures for Modified Policy Iteration Algorithms," Operations Research, INFORMS, vol. 30(2), pages 301-318, April.
    7. Powell, Warren B., 2019. "A unified framework for stochastic optimization," European Journal of Operational Research, Elsevier, vol. 275(3), pages 795-821.
    8. Daniel R. Jiang & Warren B. Powell, 2015. "An Approximate Dynamic Programming Algorithm for Monotone Value Functions," Operations Research, INFORMS, vol. 63(6), pages 1489-1511, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lee, Jinkyu & Bae, Sanghyeon & Kim, Woo Chang & Lee, Yongjae, 2023. "Value function gradient learning for large-scale multistage stochastic programming problems," European Journal of Operational Research, Elsevier, vol. 308(1), pages 321-335.
    2. Benedikt Finnah, 2022. "Optimal bidding functions for renewable energies in sequential electricity markets," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 1-27, March.
    3. Preil, Deniz & Krapp, Michael, 2022. "Bandit-based inventory optimisation: Reinforcement learning in multi-echelon supply chains," International Journal of Production Economics, Elsevier, vol. 252(C).
    4. Ghadimi, Saeed & Powell, Warren B., 2024. "Stochastic search for a parametric cost function approximation: Energy storage with rolling forecasts," European Journal of Operational Research, Elsevier, vol. 312(2), pages 641-652.
    5. Visentin, Andrea & Prestwich, Steven & Rossi, Roberto & Tarim, S. Armagan, 2021. "Computing optimal (R,s,S) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming," European Journal of Operational Research, Elsevier, vol. 294(1), pages 91-99.
    6. Dijk, N.M. van, 1989. "Truncation of Markov decision problems with a queueing network overflow control application," Serie Research Memoranda 0065, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    7. Oleksandr Shlakhter & Chi-Guhn Lee, 2013. "Accelerated modified policy iteration algorithms for Markov decision processes," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(1), pages 61-76, August.
    8. Weitzel, Timm & Glock, Christoph H., 2018. "Energy management for stationary electric energy storage systems: A systematic literature review," European Journal of Operational Research, Elsevier, vol. 264(2), pages 582-606.
    9. Santos, A.M.P. & Fagerholt, Kjetil & Laporte, Gilbert & Guedes Soares, C., 2022. "A stochastic optimization approach for the supply vessel planning problem under uncertain demand," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 209-228.
    10. Arruda, E.F. & Fragoso, M.D., 2015. "Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm," European Journal of Operational Research, Elsevier, vol. 240(3), pages 697-705.
    11. Finnah, Benedikt & Gönsch, Jochen & Ziel, Florian, 2022. "Integrated day-ahead and intraday self-schedule bidding for energy storage systems using approximate dynamic programming," European Journal of Operational Research, Elsevier, vol. 301(2), pages 726-746.
    12. Ambrosius, M. & Egerer, J. & Grimm, V. & Weijde, A.H. van der, 2020. "Uncertain bidding zone configurations: The role of expectations for transmission and generation capacity expansion," European Journal of Operational Research, Elsevier, vol. 285(1), pages 343-359.
    13. Bastian, Nathaniel D. & Lunday, Brian J. & Fisher, Christopher B. & Hall, Andrew O., 2020. "Models and methods for workforce planning under uncertainty: Optimizing U.S. Army cyber branch readiness and manning," Omega, Elsevier, vol. 92(C).
    14. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    15. Romero-Silva, Rodrigo & de Leeuw, Sander, 2021. "Learning from the past to shape the future: A comprehensive text mining analysis of OR/MS reviews," Omega, Elsevier, vol. 100(C).
    16. Kayacık, Sezen Ece & Basciftci, Beste & Schrotenboer, Albert H. & Ursavas, Evrim, 2025. "Partially adaptive multistage stochastic programming," European Journal of Operational Research, Elsevier, vol. 321(1), pages 192-207.
    17. Fleckenstein, David & Klein, Robert & Steinhardt, Claudius, 2023. "Recent advances in integrating demand management and vehicle routing: A methodological review," European Journal of Operational Research, Elsevier, vol. 306(2), pages 499-518.
    18. Selçuklu, Saltuk Buğra & Coit, David W. & Felder, Frank A., 2020. "Pareto uncertainty index for evaluating and comparing solutions for stochastic multiple objective problems," European Journal of Operational Research, Elsevier, vol. 284(2), pages 644-659.
    19. Marlin W. Ulmer & Barrett W. Thomas & Ann Melissa Campbell & Nicholas Woyak, 2021. "The Restaurant Meal Delivery Problem: Dynamic Pickup and Delivery with Deadlines and Random Ready Times," Transportation Science, INFORMS, vol. 55(1), pages 75-100, 1-2.
    20. Lin, Zhiyi & Song, Chunyue & Zhao, Jun & Yin, Huan, 2022. "Improved approximate dynamic programming for real-time economic dispatch of integrated microgrids," Energy, Elsevier, vol. 255(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:324:y:2025:i:1:p:155-167. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.