TY - JOUR
T1 - On reliability evaluation of a stochastic-flow network in terms of minimal cuts
AU - Lin, Yi-Kuei
PY - 2001/1/1
Y1 - 2001/1/1
N2 - In a stochastic-flow network, each arc has several capacity levels. Given the system demand d, the reliability of such a network for demand d (i.e., the probability that the maximum flow is not less than d) can be computed in terms of d-MCs. Jane, Lin and Yuan have presented an algorithm to generate all d-MCs in terms of minimal cuts. This article proposes another algorithm, which is based on the more publicly accepted “comparison” method, to evaluate the reliability. To compare such two algorithms, one example is illustrated to show how d-MCs are generated differently. Also, the computational complexity is analyzed.
AB - In a stochastic-flow network, each arc has several capacity levels. Given the system demand d, the reliability of such a network for demand d (i.e., the probability that the maximum flow is not less than d) can be computed in terms of d-MCs. Jane, Lin and Yuan have presented an algorithm to generate all d-MCs in terms of minimal cuts. This article proposes another algorithm, which is based on the more publicly accepted “comparison” method, to evaluate the reliability. To compare such two algorithms, one example is illustrated to show how d-MCs are generated differently. Also, the computational complexity is analyzed.
KW - Capacity
KW - Minimal cut
KW - Reliability
KW - Stochastic-flow network
UR - http://www.scopus.com/inward/record.url?scp=0002323308&partnerID=8YFLogxK
U2 - 10.1080/10170660109509457
DO - 10.1080/10170660109509457
M3 - Article
AN - SCOPUS:0002323308
VL - 18
SP - 49
EP - 54
JO - Journal of Industrial and Production Engineering
JF - Journal of Industrial and Production Engineering
SN - 2168-1015
IS - 3
ER -