IDEAS home Printed from https://ideas.repec.org/a/eee/reensy/v261y2025ics095183202500273x.html
   My bibliography  Save this article

Applying incremental learning in binary-addition-tree algorithm in reliability analysis of dynamic binary-state networks

Author

Listed:
  • Hao, Zhifeng
  • Yeh, Wei-Chang

Abstract

This paper presents a novel approach to enhance the Binary-Addition-Tree algorithm (BAT) by integrating incremental learning techniques. BAT, known for its simplicity in development, implementation, and application, is a powerful implicit enumeration method for solving network reliability and optimization problems. However, it traditionally struggles with dynamic and large-scale networks due to its static nature. By introducing incremental learning, we enable the BAT to adapt and improve its performance iteratively as it encounters new data or network changes. This integration allows for more efficient computation, reduces redundancy without searching for minimal paths and cuts, and improves overall performance in dynamic environments. Experimental results demonstrate the effectiveness of the proposed method, showing significant improvements in both computational efficiency and solution quality compared to the traditional BAT and indirect algorithms, such as MP (minimal path) -based algorithms and MC (minimal cut) -based algorithms.

Suggested Citation

  • Hao, Zhifeng & Yeh, Wei-Chang, 2025. "Applying incremental learning in binary-addition-tree algorithm in reliability analysis of dynamic binary-state networks," Reliability Engineering and System Safety, Elsevier, vol. 261(C).
    • Handle: RePEc:eee:reensy:v:261:y:2025:i:c:s095183202500273x
    DOI: 10.1016/j.ress.2025.111072
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S095183202500273X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ress.2025.111072?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.

    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:reensy:v:261:y:2025:i:c:s095183202500273x. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/reliability-engineering-and-system-safety .

    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.