A New Node-Based Algorithm for Identifying the Complete Minimal Cut Set

被引:0
|
作者
Yeh, Wei-Chang [1 ]
Yang, Guangyi [2 ]
Huang, Chia-Ling [3 ]
机构
[1] Natl Tsing Hua Univ, Dept Ind Engn & Engn Management, Integrat & Collaborat Lab, Hsinchu 300044, Taiwan
[2] Natl Tsing Hua Univ, Inst Technol Management, Hsinchu 300044, Taiwan
[3] Kainan Univ, Dept Int Logist & Transportat Management, Taoyuan 33857, Taiwan
关键词
binary-state network; network reliability; minimal cut (MC); binary-addition-tree algorithm (BAT); recursive method; RELIABILITY EVALUATION; BINARY-SYSTEMS; SEARCH;
D O I
10.3390/electronics13030603
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The binary-state network, which is fundamental to several modern systems, only operates in two states: operational or inoperable. Network reliability is crucial in its planning, design, and evaluation, with the minimal cut (MC) being a cornerstone for reliability algorithms. A recursive binary-addition-tree algorithm (BAT) excels in its capacity to promptly eliminate infeasible vectors. However, it relies on a depth-first search (DFS), a technique surpassed in efficiency by BAT. To the best of our knowledge, no exploration into a recursive MC-based BAT for MC identification has been undertaken thus far. Therefore, this manuscript introduces the recursive node-based BAT, devised such that the ith iteration of the jth vector mirrors its progenitor vector, barring its ith coordinate valued at one. This BAT method, paired with rules to eliminate infeasible vectors, demonstrates high efficiency in deriving MCs. This is evident in the time complexity analysis and tests on 20 benchmark binary-state networks. A thorough examination of the empirical findings highlights the distinctive features and benefits of the proposed approach. Specifically, the strategic reordering of node numbers, along with the isolated nodes concept, significantly reduces the occurrence of infeasible vectors. Simultaneously, the inclusion of edge nodes expedites the feasibility verification process for vectors. Ultimately, the proposed recursive node-based BAT algorithm framework ensures a more efficient process for generating vectors.
引用
收藏
页数:20
相关论文
共 50 条
  • [1] An improved minimal cut set algorithm
    Int J Qual Reliab Manage, 2 (114):
  • [2] A New Node-Based Concept for Solving the Minimal Path Problem in General Networks
    Zhu, Wenbo
    Yeh, Wei-Chang
    Xiong, Neal Naixue
    Sun, Bin
    IEEE ACCESS, 2019, 7 : 173310 - 173319
  • [3] New and efficient node-based local mesh generation parallel algorithm
    Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an 710072, China
    Xibei Gongye Daxue Xuebao, 2006, 6 (731-735):
  • [4] A faulty sensor node tolerance algorithm based on cut point set
    Ye, Songtao
    Lin, Yaping
    Hu, Yupeng
    Zhou, Siwang
    You, Zhiqiang
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2009, 46 (12): : 2117 - 2125
  • [5] A novel node-based structural shape optimization algorithm
    Song, X
    Baldwin, JD
    COMPUTERS & STRUCTURES, 1999, 70 (05) : 569 - 581
  • [6] Node-based adaptive fractional distributed optimization algorithm
    Peng, Huaijin
    Xu, Haoran
    Yue, Dongdong
    Wei, Yiheng
    2024 14TH ASIAN CONTROL CONFERENCE, ASCC 2024, 2024, : 123 - 128
  • [7] Investigating a Minimal Categorical Perception Task with a Node-Based Sensorimotor Map
    Woolford, Felix M. G.
    Egbert, Matthew D.
    FROM ANIMALS TO ANIMATS 16, 2022, 13499 : 28 - 40
  • [8] Node-based genetic algorithm for communication spanning tree problem
    Lin, L
    Gen, M
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2006, E89B (04) : 1091 - 1098
  • [9] A Node-based Parallel Game Tree Algorithm Using GPUs
    Li, Liang
    Liu, Hong
    Liu, Peiyu
    Liu, Taoying
    Li, Wei
    Wang, Hao
    2012 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING (CLUSTER), 2012, : 18 - 26
  • [10] Test Node-Based WCL Algorithm for Wireless Sensor Networks
    Kim, Kwang-Yul
    Shin, Yoan
    2016 EIGHTH INTERNATIONAL CONFERENCE ON UBIQUITOUS AND FUTURE NETWORKS (ICUFN), 2016, : 418 - 423