Novel binary-addition tree algorithm (BAT) for binary-state network reliability problem

•A novel binary-addition tree (BAT) algorithm is proposed.•BAT is simple to understand, easy to code, and flexible to made-to-fit.•A fast algorithm to calculate the binary-state network reliability.•BAT outperforms path- and cut-based algorithms from the time complexity.•BAT outperforms QIE which is the best related algorithm from the experiments. Network structures and models have been widely adopted, e.g., for Internet of Things, wireless sensor networks, smart grids, transportation networks, communication networks, social networks, and computer grid systems. Network reliability is an effective and popular technique to estimate the probability that the network is still functioning. Networks composed of binary-state (e.g., working or failed) components (arcs and/or nodes) are called binary-state networks. The binary-state network is the fundamental type of network; thus, there is always a need for a more efficient algorithm to calculate the network reliability. Thus, a novel binary-addition tree (BAT) algorithm that employs binary addition for finding all the possible state vectors and the path-based layered-search algorithm for filtering out all the connected vectors is proposed for calculating the binary-state network reliability. According to the time complexity and numerical examples, the efficiency of the proposed BAT is higher than those of traditional algorithms for solving the binary-state network reliability problem.