Abstract:
A multistate network is a system composed of multistate components. The network reliability under the cost constraint for level (d; c) can be computed in terms of (d; c)-MP (MP stands for minimal path) which is a vector such that d units of 0ow can be transmitted between two speci1ed nodes with the total cost not greater than c. In this study, a new algorithm was developed to evaluate the reliabilityof multistate networks under cost constraint in terms of the entire (d; c)-MPs. The proposed method is more e4cient than the best-known existing algorithm. One example is illustrated to show how all (d; c)-MPs are generated bythe proposed algorithm. The reliabilityof this example is then computed. The computational complexityof the proposed algorithm is also analyzed.
