IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v49y2020i15p3772-3791.html
   My bibliography  Save this article

An improved algorithm for reliability bounds of multistate networks

Author

Listed:
  • Chao Zhang
  • Tao Liu
  • Guanghan Bai

Abstract

Indirect approaches based on minimal path vectors (d-MPs) and/or minimal cut vectors (d-MCs) are reported to be efficient for the reliability evaluation of multistate networks. Given the need to find more efficient evaluation methods for exact reliability, such techniques may still be cumbersome when the size of the network and the states of component are relatively large. Alternatively, computing reliability bounds can provide approximated reliability with less computational effort. Based on Bai’s exact and indirect reliability evaluation algorithm, an improved algorithm is proposed in this study, which provides sequences of upper and lower reliability bounds of multistate networks. Novel heuristic rules with a pre-specified value to filter less important sets of unspecified states are then developed and incorporated into the algorithm. Computational experiments comparing the proposed methods with an existing direct bounding algorithm show that the new algorithms can provide tight reliability bounds with less computational effort, especially for the proposed algorithm with heuristic L1.

Suggested Citation

  • Chao Zhang & Tao Liu & Guanghan Bai, 2020. "An improved algorithm for reliability bounds of multistate networks," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 49(15), pages 3772-3791, August.
    • Handle: RePEc:taf:lstaxx:v:49:y:2020:i:15:p:3772-3791
    DOI: 10.1080/03610926.2020.1752728
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2020.1752728
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2020.1752728?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.

    Citations

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


    Cited by:

    1. Xu, Bei & Liu, Tao & Bai, Guanghan & Tao, Junyong & Zhang, Yun-an & Fang, Yining, 2022. "A multistate network approach for reliability evaluation of unmanned swarms by considering information exchange capacity," Reliability Engineering and System Safety, Elsevier, vol. 219(C).
    2. Bigatti, A.M. & Pascual-Ortigosa, P. & Sáenz-de-Cabezón, E., 2021. "A C++ class for multi-state algebraic reliability computations," Reliability Engineering and System Safety, Elsevier, vol. 213(C).

    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:lstaxx:v:49:y:2020:i:15:p:3772-3791. 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/lsta .

    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.