Int J Performability Eng ›› 2015, Vol. 11 ›› Issue (1): 81-90.doi: 10.23940/ijpe.15.1.p81.mag
• Original articles •
SUPARNA CHAKRABORTY and NEERAJ KUMAR GOYAL
A general assumption made in evaluation of flow network reliability is perfectly reliable nodes. Under such assumption, network reliability is evaluated through subset cut or composite path set approaches. This paper presents a simple approach to account for node failures in reliability evaluation of flow networks using subset cut approach. The proposed approach starts with generating combinations of nodes of the network and utilizes subset cuts (with perfect nodes) to find the valid additional subset cuts due to imperfect nodes. These additional subset cuts consist of only nodes or nodes-links combinations. To illustrate efficacy of the proposed approach, computational results on various benchmarks networks are provided. The proposed method is applicable to evaluate additional minimal cut sets due to imperfect nodes from minimal cut sets (with perfect nodes) for networks considering only connectivity as the success criteria or additional subset cut set for networks with multiple node pair capacity requirements.
SUPARNA CHAKRABORTY and NEERAJ KUMAR GOYAL. Subset Cut Enumeration of Flow Networks with Imperfect Nodes [J]. Int J Performability Eng, 2015, 11(1): 81-90.
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks