IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v75y2024i5p921-941.html
   My bibliography  Save this article

An approximate dynamic programming approach for the maintenance optimisation of networked critical infrastructures

Author

Listed:
  • Wanshan Li
  • Chi Zhang
  • Liuquan Li

Abstract

The continuous performance of networked infrastructures, such as transportation, telecommunications, and power transmission, is critical to the economic development and social well-being of society. To ensure their reliability in continuously meeting prescribed demand, cost-effective maintenance is essential. To this end, the influence of maintenance actions measures on the reliability of an infrastructure need to be considered both during their implementation and after their completion. To address this problem and to consider the uncertainty of future states, we model the multi-period optimisation of an infrastructure’s maintenance planning as a stochastic dynamic programming problem. An approximate dynamic programming approach is developed to deal with the computational complexity and solve the described problem. The proposed approach can help deal with the uncertainty of future infrastructure states by determining the optimal maintenance plan for each possible state in advance.

Suggested Citation

  • Wanshan Li & Chi Zhang & Liuquan Li, 2024. "An approximate dynamic programming approach for the maintenance optimisation of networked critical infrastructures," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 75(5), pages 921-941, May.
  • Handle: RePEc:taf:tjorxx:v:75:y:2024:i:5:p:921-941
    DOI: 10.1080/01605682.2023.2219693
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2023.2219693
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2023.2219693?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 search for a different version of it.

    More about this item

    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:taf:tjorxx:v:75:y:2024:i:5:p:921-941. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.