On reliability evaluation of a stochastic-flow network in terms of minimal cuts

Yi-Kuei Lin*

*Corresponding author for this work

Research output: Contribution to journalArticle

64 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)49-54
Number of pages6
JournalJournal of the Chinese Institute of Industrial Engineers
Volume18
Issue number3
DOIs
StatePublished - 1 Jan 2001

Keywords

  • Capacity
  • Minimal cut
  • Reliability
  • Stochastic-flow network

Fingerprint Dive into the research topics of 'On reliability evaluation of a stochastic-flow network in terms of minimal cuts'. Together they form a unique fingerprint.

  • Cite this