A Fast Algorithm for Searching All Multi-State Minimal Cuts
Evaluating network reliability is an important topic in planning, designing, and control of systems. Many real-world systems are limited-flow (multi-state) networks composed of multi-state components, and their reliabilities can be computed in terms of minimal cut (Me) vectors to level d (named d-MC). A straightforward exact algorithm is presented here. The idea is to find all d-MC prior to calculating the limited-flow network reliability between the source, and the sink nodes (i.e. the one-to-one reliability), under the condition that all MC are known in advance. The proposed method is more efficient and effective compared to the existing algorithms in deleting the duplicate d-MC, verifying d-MC candidates, and finding the lower bounds of edge capacities in d-MC. The concepts of the proposed algorithm are novel, and first developed, followed by the analysis of associated computational complexities. Further, an example is provided to illustrate the generation of all d-MC, and verify that the obtained d-MC are not duplicated.
network reliability limited-flow (multi-state) network d-mc/mc perfect node unreliable node