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 条
  • [41] AIGCrank: A new adaptive algorithm for identifying a set of influential spreaders in complex networks based on gravity centrality
    杨平乐
    赵来军
    董晨
    徐桂琼
    周立欣
    Chinese Physics B, 2023, (05) : 827 - 839
  • [42] A novel node-based non-structural model for mass exchanger network synthesis using a stochastic algorithm
    Zhou, Zhiqiang
    Cui, Guoming
    Xiao, Yuan
    JOURNAL OF CLEANER PRODUCTION, 2022, 376
  • [43] Enhanced connectivity for nodes to measure coverage range using anchor node-based PATH monitoring algorithm in WSN
    Anshad, A. S.
    Radhakrishnan, R.
    TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2020, 31 (12)
  • [44] MESSAGE PASSING AND LOOPS SOLUTION ALGORITHM BASED ON CUT-NODE TREE
    Zhang Huanming
    Xian Kaiyi
    Feng Lijun
    Hu Chaokang
    INTERNATIONAL JOURNAL OF GEOMATE, 2016, 11 (27): : 2804 - 2807
  • [45] M-ANCHORO: Mobile Anchor Node-Based Path Optimization for Full Coverage Path Planning Algorithm
    Tsai, Rong-Guei
    Zhao, Jixin
    Yu, Yicong
    Lin, Di
    Hong, Anxuan
    Lin, Chengzhu
    Chen, Xiaolan
    Luo, Delin
    Lin, Lin
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2024, 2024
  • [46] A De Bruijn Graph Localization Algorithm Based on Minimal Set of Edges
    Yu C.-Y.
    Jin J.-Y.
    Liu P.
    Zhao Y.-H.
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2022, 43 (02): : 153 - 159
  • [47] QCA based FIR Serial multiplier using cut-set algorithm
    Pandiammal, K.
    Meganathan, D.
    2017 IEEE 17TH INTERNATIONAL CONFERENCE ON NANOTECHNOLOGY (IEEE-NANO), 2017, : 983 - 988
  • [48] A new algorithm for generating minimal cut sets in k-out-of-n networks
    Yeh, WC
    RELIABILITY ENGINEERING & SYSTEM SAFETY, 2006, 91 (01) : 36 - 43
  • [49] Benefits of Bias in Crawl-Based Network Sampling for Identifying Key Node Set
    Tsugawa, Sho
    Ohsaki, Hiroyuki
    IEEE ACCESS, 2020, 8 (08): : 75370 - 75380
  • [50] A Quantitative Method to Evaluate System Resilience Based on Minimal Cut-set and Sensitivity Analysis
    Yang, Chenxuan
    Kang, Rui
    Zhang, Yanbo
    Yang, Yi
    2016 PROGNOSTICS AND SYSTEM HEALTH MANAGEMENT CONFERENCE (PHM-CHENGDU), 2016,