The Extension of Universal Generating Function Method to Search for All One-to-Many $d$ -Minimal Paths of Acyclic Multi-State-Arc Flow-Conservation Networks

Evaluating network reliability is an important step in the planning, design, and control of systems. The acyclic multi-state-arc flow-conservation network (AMAFCN) is a special multi-state-arc flow-conservation network (MAFCN) of which each arc has independent, discrete, limited multi-states (capacities), and satisfied flow conservation. The AMAFCN is arranged in such a way that no flow leaving a node can return this node through any sequence of nodes, e.g. no cycles exist. For such networks, we are interested in evaluating the AMAFCN reliability, i.e. the probability that the flow from the source node to the sink node is equal to or greater than a demanded flow of units. A general method for the MAFCN/AMAFCN reliability evaluation is using minimal path/cut vectors with system state (called the -MP/-MC). In this study, we focused on developing an extension of the universal generating function method (UGFM) to find the entire one-to-many -MP before calculating the AMAFCN reliability between the source node, and some node subset (i.e. one-to-many reliability). The computational complexity of the proposed algorithm is also analyzed. Finally, one example is given to illustrate how entire one-to-many -MP are generated using the proposed algorithm. Then, all one-to-many reliabilities of this example are calculated.