论文标题
新颖的界限二进制二元树算法，用于二进制网络可靠性问题
Novel Bounded Binary-Addition Tree Algorithm for Binary-State Network Reliability Problems
论文作者
论文摘要
许多网络应用程序基于二进制网络，每个组件都有两个状态之一：成功或失败。不断开发评估二元状态网络可靠性的有效算法。可靠性估计成功状态的概率，是二进制国家网络的有效且流行的评估技术。二进制成型树（BAT）算法经常用于计算二元状态网络的效率和可靠性。在这项研究中，我们提出了一种采用三个新颖概念的新颖，有界的蝙蝠算法：第一个连接的向量，最后一个断开的向量和超级向量。这些向量及其发生概率的计算范围缩小了搜索空间，并简化了概率计算以减少算法的运行时间。此外，我们表明，在拟议的算法中不需要用两个定向的弧代替每个无向弧，这是传统直接方法所必需的。我们将这个新颖的概念称为无向量。通过解决基准一组问题，通过实验验证了拟议有限的BAT算法的性能。
Many network applications are based on binary-state networks, where each component has one of two states: success or failure. Efficient algorithms to evaluate binary-state network reliability are continually being developed. Reliability estimates the probability of the success state and is an effective and popular evaluation technique for binary-state networks. Binary-addition tree (BAT) algorithms are frequently used to calculate the efficiency and reliability of binary-state networks. In this study, we propose a novel, bounded BAT algorithm that employs three novel concepts: the first connected vector, the last disconnected vector, and super vectors. These vectors and the calculations of their occurrent probabilities narrow the search space and simplify the probability calculations to reduce the run time of the algorithm. Moreover, we show that replacing each undirected arc with two directed arcs, which is required in traditional direct methods, is unnecessary in the proposed algorithm. We call this novel concept the undirected vectors. The performance of the proposed bounded BAT algorithm was verified experimentally by solving a benchmark set of problems.
