Close category search window
 

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
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 )

Date of Publication: March 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.