IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v42y1994i5p940-946.html
   My bibliography  Save this article

Accelerating Procedures of the Value Iteration Algorithm for Discounted Markov Decision Processes, Based on a One-Step Lookahead Analysis

Author

Listed:
  • Meir Herzberg

    (Telecom Australia Research Laboratories, Clayton, Victoria, Australia)

  • Uri Yechiali

    (Tel Aviv University, Tel Aviv, Israel)

Abstract

Accelerating procedures for solving discounted Markov decision processes problems are developed based on a one-step lookahead analysis of the value iteration algorithm. We apply the criteria of minimum difference and minimum variance to obtain good adaptive relaxation factors that speed up the convergence of the algorithm. Several problems (including Howard's automobile replacement) are tested and a preliminary numerical evaluation reveals considerable reductions in computation time when compared to existing value iteration schemes.

Suggested Citation

  • Meir Herzberg & Uri Yechiali, 1994. "Accelerating Procedures of the Value Iteration Algorithm for Discounted Markov Decision Processes, Based on a One-Step Lookahead Analysis," Operations Research, INFORMS, vol. 42(5), pages 940-946, October.
  • Handle: RePEc:inm:oropre:v:42:y:1994:i:5:p:940-946
    DOI: 10.1287/opre.42.5.940
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.42.5.940
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.42.5.940?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Herzberg, Meir & Yechiali, Uri, 1996. "A K-step look-ahead analysis of value iteration algorithms for Markov decision processes," European Journal of Operational Research, Elsevier, vol. 88(3), pages 622-636, February.
    2. George Liberopoulos & Dimitrios Pandelis & Olympia Hatzikonstantinou, 2013. "The stochastic economic lot sizing problem for non-stop multi-grade production with sequence-restricted setup changeovers," Annals of Operations Research, Springer, vol. 209(1), pages 179-205, October.
    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. 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.

    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:inm:oropre:v:42:y:1994:i:5:p:940-946. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.