By Topic

A Practical Algorithm for Computing Multi-State Two-Terminal 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
$33 $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

2 Author(s)
Chin-Chia Jane ; Dept. of Inf. Manage., Ling Tung Univ., Taichung ; Yih-Wenn Laih

A practical, important system performance index for analyzing real world systems is NP-hard multi-state two-terminal reliability. Contributions of this paper are 1) it presents a direct, correct decomposition method for solving NP-hard multi-state two-terminal reliability, and 2) it does not require a priori the multi-state minimal paths/cuts of the system. Because all the exact methods solve the multi-state two-terminal reliability problem in terms of two/three NP-hard problems, excluding the impractical complete enumeration method, and Doulliez & Jamoulle's popular but incorrect decomposition method, development of such an exact, direct, and practical algorithm is thus worthwhile. Computational experiments verify that the proposed method is practical, fast, and efficient in comparison with the complete enumeration method.

Published in:

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