Building reliable budget-based binary-state networks

•Existing studies are without considering the total budget of the entire network.•Propose a more reliable binary-state network under the budget limit.•Propose the first accurate algorithm for the proposed problem.•Propose the first BAT-algorithm for the proposed problem.•Propose stepwise vectors for...

Full description

Saved in:
Bibliographic Details
Published in:Reliability engineering & system safety Vol. 240; p. 109567
Main Author: Yeh, Wei-Chang
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.12.2023
Subjects:
Binary-Addition-Tree Algorithm (BAT)
Binary-state Network
Budget Limit
Minimal Path (MP)
Network reliability
Stepwise vectors
Budget Limit
Stepwise vectors
Minimal Path (MP)
Network reliability
Binary-state Network
Binary-Addition-Tree Algorithm (BAT)
ISSN:0951-8320, 1879-0836
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•Existing studies are without considering the total budget of the entire network.•Propose a more reliable binary-state network under the budget limit.•Propose the first accurate algorithm for the proposed problem.•Propose the first BAT-algorithm for the proposed problem.•Propose stepwise vectors for BAT. Everyday life is driven by various network, such as supply chains for distributing raw materials, semi-finished product goods, and final products; Internet of Things (IoT) for connecting and exchanging data; utility networks for transmitting fuel, power, water, electricity, and 4 G/5 G; and social networks for sharing information and connections. The binary-state network is a basic network, where the state of each component is either success or failure, i.e., the binary-state. Network reliability plays an important role in evaluating the performance of network planning, design, and management. Because more networks are being set up in the real world currently, there is a need for their reliability. It is necessary to build a reliable network within a limited budget. However, existing studies are focused on the budget limit for each minimal path (MP) in networks without considering the total budget of the entire network. We propose a novel concept to consider how to build a more reliable binary-state network under the budget limit. In addition, we propose an algorithm based on the binary-addition-tree algorithm (BAT) and stepwise vectors to solve the problem efficiently.
ISSN:0951-8320
1879-0836
DOI:10.1016/j.ress.2023.109567