摘要
The d-MP is a special state vector such that the maximal flow is d in the related network and any state vector less than d-MP is not a d-MP. The d-MP is one of the major tools in evaluating the reliability of a multistate flow network. The d-MPs for all d problem is to search for all d-MPs for all possible d. Decision-makers may use them to choose the best d under given scenarios. Current algorithms for addressing this problem are all based on the addition of 1-MPs and (d − 1)-MPs to generate d-MP combinations, and then detect and remove d-MP combinations with infeasible states, redundant states, and/or duplications. A new algorithm based on the subtraction of (d + 1)-MPs and 1-MPs to obtain d-MP combinations is proposed in this paper to overcome the above three obstacles in current algorithms. The time complexity and demonstration of the proposed algorithm are also analyzed and provided using examples. An experiment is conducted to compare the performance of the proposed subtraction-based algorithm with that of the best known addition-based algorithm. © 2019 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.