## 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 language | English |
---|---|

Pages (from-to) | 282-289 |

Number of pages | 8 |

Journal | International Journal of Industrial Engineering : Theory Applications and Practice |

Volume | 20 |

Issue number | 3-4 |

State | Published - 23 Sep 2013 |

## Keywords

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