For a stochastic and directed capacitated-flow network in which the capacity of each arc has several possible values, this article generalizes the system reliability problem from single source node and single sink node cases to an overall-terminal case. Given the demand for each node pair simultaneo
Study on the multicommodity reliability of a capacitated-flow network
โ Scribed by Yi-Kuei Lin
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 593 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
โฆ Synopsis
Traditionally, many researchers solved the multicommodity maximum flow problem by assuming that the arcs of the flow network are deterministic. When the arcs are stochastic (i.e., the capacity of each arc has several values), this article studies how to calculate the probability that a capacitated-flow network with a unique source node satisfies a demand (d', d2,.
, dp) at the unique sink node, where dk is the demand of commodity Ic. Such a probability is named the multicommodity reliability and is dependent on capacities of arcs. One solution procedure is proposed to evaluate the multicommodity reliability, which includes two parts: an algorithm to generate all (dl, d2,. , dP)-MPs and a method to calculate the multicommodity reliability in terms of (dl, d2,.
, dP)-MPs. Two illustrative examples are given.
๐ SIMILAR VOLUMES
Many real-world systems such as electric power transmission and distribution systems, transportation systems, and manufacturing systems can be regarded as flow networks whose arcs have independent, finite, and multivalued random capacities. Such a flow network is indeed a multistate system with mult