Quick reliability assessment of two-commodity transmission through a capacitated-flow network

Yi-Kuei Lin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Each arc in a capacitated-flow network has discrete and multiple-valued random capacities. Many studies evaluated the probability named system reliability herein that the maximum flow from source to sink is no less than a demand d for a capacitated-flow network. Such studies only considered commodities of a same type transmitted throughout the network. Many real-world systems allow commodities of multiple types to be transmitted simultaneously, especially in the case that different type of commodity consumes the arc's capacity differently. For simplicity, this article assesses the system reliability for a two-commodity case as follows. Given the demand (d1,d2), where d1 and d2 are the demands of commodity 1 and 2 at the sink, respectively, an algorithm is proposed to find out all lower boundary points for (d1,d2). The system reliability can be computed quickly in terms of such points. The computational complexity of the proposed algorithm is also analyzed.

Original languageEnglish
Pages (from-to)282-289
Number of pages8
JournalInternational Journal of Industrial Engineering : Theory Applications and Practice
Volume20
Issue number3-4
StatePublished - 23 Sep 2013

Keywords

  • Capacitated-flow networks
  • Minimal paths
  • Reliability
  • Two-commodity

Fingerprint Dive into the research topics of 'Quick reliability assessment of two-commodity transmission through a capacitated-flow network'. Together they form a unique fingerprint.

Cite this