论文标题
基于BAT的新型递归包容性排斥技术，而国会议员用于异质 - 二进制二进制网络可靠性问题
Novel Recursive Inclusion-Exclusion Technology Based on BAT and MPs for Heterogeneous-Arc Binary-State Network Reliability Problems
论文作者
论文摘要
当前的网络应用程序，例如公用事业网络（天然气，水，电力和4G/5G），物联网（IoT），社交网络和供应链，都基于二进制状态网络。可靠性是评估网络性能的最常用工具之一，最小路径（MP）是计算可靠性的基本算法。但是，几乎所有现有的算法都认为所有无向弧都是均匀的。也就是说，来自节点A到B的电弧的概率等于节点B到A的概率。因此，基于MPS，二进制 - 附加算法（BAT）和包含 - 排放技术（IET），一种新颖的递归包容性排斥技术算法被称为基于递归蝙蝠IET（RIE），旨在使多种抗性的Arcence-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc-Arc biarce biarce网络可靠性问题越来越多，以使以上企业胜任。使用说明性示例分析了所提出的RIE的计算复杂性。最后，使用11个基准问题来验证RIE的性能。
Current network applications, such as utility networks (gas, water, electricity, and 4G/5G), the Internet of Things (IoT), social networks, and supply chains, are all based on binary state networks. Reliability is one of the most commonly used tools for evaluating network performance, and the minimal path (MP) is a basic algorithm for calculating reliability. However, almost all existing algorithms assume that all undirected arcs are homogeneous; that is, the probability of an arc from nodes a to b is equal to that from nodes b to a. Therefore, based on MPs, the binary-addition-tree algorithm (BAT), and the inclusion-exclusion technique (IET), a novel recursive inclusion-exclusion technology algorithm known as recursive BAT-based IET (RIE) is proposed to solve the heterogeneous-arc binary-state network reliability problem to overcome the above obstacles in applications. The computational complexity of the proposed RIE is analyzed using an illustrative example. Finally, 11 benchmark problems are used to verify the performance of RIE.
