PROJECT TITLE :

Irredundant Subset Cut Enumeration for Reliability Evaluation of Flow Networks

ABSTRACT:

Capacity Connected Reliability (CRR) is an important performance index for flow networks. Most of the CRR analysis techniques proposed in literature, that cope with subset cut enumeration from minimal cut sets, generate a massive range of redundant subsets. The efforts in validating these subsets as cuts and then removing the redundant subset cuts makes these approaches computationally inefficient. To unravel this drawback, this paper proposes a replacement subset cut enumeration technique employing a proposed decomposition methodology to avoid generating higher order redundant subset cuts of the network, where order refers to the amount of links gift within the cut. The proposed decomposition method decomposes a cut into new cuts if the cut encompasses a subset in already enumerated valid subset cuts. Such newly generated cuts don't have any subset which is equal to or a superset of already enumerated valid subset cuts. Thus, if the subsets of these newly generated cuts qualify as valid subset cuts, then none of them are equal to or a superset of any earlier valid subset cuts. The subset cut enumeration technique, along with the decomposition methodology, completely eliminates the possibilities of generating higher order redundant subset cuts. But, it leaves a tiny likelihood of generating redundant subset cuts as generally an already enumerated valid subset cut might become a superset of a valid subset cut, enumerated from a minimal cut treated later, making previously enumerated valid subset cut(s) redundant.