By Topic

A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network

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

1 Author(s)
Wei-Chang Yeh ; Feng Chia Univ., Taichung, Taiwan

Many real-world systems are multistate and composed of multistate components in which the reliability can be computed in terms of the lower bound points of level d, called d-minpaths (d-MP). Such systems (electric power, transportation, etc.) may be regarded as flow networks whose arcs have statistically independent, discrete, limited and multivalued random capacities. This study focuses on how to find the entire path of d-MP before calculating the reliability of an acyclic network. Analysis of the authors' “revised layered network algorithm” (RLNA) and comparison to existing algorithms show that RLNA has the advantages: (1) it can be used to search for all MP, an NP-hard problem that is assumed to be known in advance in the existing algorithms; (2) the original NP-hard problem can be decomposed into several smaller subproblems using the RLNA such that the d-MP candidates are simple to find and verify, which is more effective than the existing methods; and (3) RLNA is easier to understand and implement. This paper first develops the intuitive RLNA. The computational complexity of RLNA is then analyzed and compared with existing methods. An example illustrates how all d-MP are generated

Published in:

IEEE Transactions on Reliability  (Volume:47 ,  Issue: 4 )