By Topic

A Greedy Branch-and-Bound Inclusion-Exclusion Algorithm for Calculating the Exact Multi-State Network Reliability

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Wei-Chang Yeh ; Nat. Tsing Hua Univ., Hsinchu

In this study, a new IE (Inclusion-Exclusion Principle) involving some intuitive properties that characterize the structure of the intersections of d-minimal paths (d-MP)/d-minimal cuts (d-MC), and the relationships between d-MP/d-MC is developed to improve the IE for calculating the exact multi-state network (MSN) reliability. The proposed IE (called the Greedy-B&B-IE) developed first a greedy procedure for reordering d-MP/d-MC to speed up the procedure in detecting & deleting dominated terms. Then, a Branch-and-Bound (B&B)-based technique is proposed to implement the IE to reduce the number of intersections, and decrease the number of multiplications required for calculating the probability value of each term.

Published in:

Reliability, IEEE Transactions on  (Volume:57 ,  Issue: 1 )