IDEAS home Printed from https://ideas.repec.org/a/sae/risrel/v240y2026i2p572-581.html

Destruction resistance optimization of chemical material network based on discrete space binary ABC algorithm

Author

Listed:
  • Zhaofei Dong
  • Zheng Wang
  • Tongtong Xie
  • Xiaofeng Zhai

Abstract

Optimizing destruction resistance of chemical material networks can reduce the occurrence and propagation of cascading failures. Most destructive resistance indexes only assess the final degree of destructive paralysis, making it difficult to accurately identify weak links. To solve this problem, toughness index is introduced. However, because it is an NP-complete problem that lacks a polynomial-time solution and cannot achieve automatic optimization and autonomous decision-making, the optimization is not guaranteed to be optimal. In order to solve the above problems, this article proposes a binary artificial bee colony algorithm (binary ABC algorithm) based on discrete space for optimizing cascade failures resistance model. Firstly, a fitness function is designed based on toughness theory. Then improve the honey source generation and update mechanisms in the ABC algorithm, and transform the search space into D-dimensional binary space, the toughness and cut point set of the network are obtained by simulation. Finally, the proposed method is compared with other optimization methods and attack strategies respectively, to determine the weak nodes in the chemical material network and optimize its destruction resistance. The case study shows that the model is feasible and can automatically select optimal attacks to identify weak links that need to be protected. The value of the destruction resistance indicator increased from 0.2748 to 0.5909, providing a theoretical basis for cascading fault analysis and prevention in chemical material networks.

Suggested Citation

  • Zhaofei Dong & Zheng Wang & Tongtong Xie & Xiaofeng Zhai, 2026. "Destruction resistance optimization of chemical material network based on discrete space binary ABC algorithm," Journal of Risk and Reliability, , vol. 240(2), pages 572-581, April.
  • Handle: RePEc:sae:risrel:v:240:y:2026:i:2:p:572-581
    DOI: 10.1177/1748006X251395155
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1748006X251395155
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1748006X251395155?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
    ---><---

    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:sae:risrel:v:240:y:2026:i:2:p:572-581. 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: SAGE Publications (email available below). General contact details of provider: .

    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.