摘要
Network structures and models have been widely adopted, and many are based on the binary-state network. Reliability is the most commonly used tool to evaluate network performance. Efficient algorithms to evaluate binary-state network reliability are continually being developed. The motivation of this study is to propose an efficient algorithm called the quick BAT to evaluate binary-state network reliability. The propose quick BAT is based on the binary-addition tree algorithm (BAT) and employs three novel concepts: the first connected vector, the last disconnected vector, and super vectors. These super vectors narrow the search space and the calculations of their occurrent probabilities 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 advantage and performance of the proposed quick BAT algorithm was verified experimentally by solving 20 benchmark problems and compared to the binary decision diagram (BDD), quick inclusion–exclusion technology (QIE), and BAT.