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...

Full description

Saved in:
Bibliographic Details
Published in:Reliability engineering & system safety Vol. 208; p. 107448
Main Author: Yeh, Wei-Chang
Format: Journal Article
Language:English
Published: Barking Elsevier Ltd 01.04.2021
Elsevier BV
Subjects:
Algorithms
Binary addition
Binary-state network
Communication networks
Internet of Things
Layered-search algorithm
Network reliability
Reliability engineering
Search algorithms
Smart grid
Social networks
Social organization
State vectors
Structural reliability
System effectiveness
System reliability
Transportation networks
Wireless networks
Wireless sensor networks
Layered-search algorithm
Network reliability
Binary-state network
Binary addition
ISSN:0951-8320, 1879-0836
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0951-8320
1879-0836
DOI:10.1016/j.ress.2021.107448