Reliability evaluation of network flows with stochastic capacity and cost constraint

H. Salehi Fathabadi and M. Khodaei

International Journal of Mathematics in Operational Research, 2012, vol. 4, issue 4, 439-452

Abstract: This paper addresses flow networks whose arcs have finite and independent random capacities. The reliability of such a system, that is the probability that d units of flow can be transmitted from the source node to the sink node with total cost at most equal to c, can be computed in terms of Minimal Path Vectors, named as (d, c)-MPs. In this paper, first, a method for computing the upper and lower bounds of the capacity cost of the system is proposed. The presented method shows how to compute a (d, c)-MP with the minimum capacity cost. Subsequently, we develop an algorithm, based on the computed bounds, to generate all (d, c)-MPs and then, the system reliability is calculated in terms of such (d, c)-MPs. The computational complexity of the proposed algorithm is also presented. At the end the solution procedure is illustrated by an example.

Keywords: reliability evaluation; stochastic network flows; minimal path; algorithm complexity; cost constraints; flow networks; stochastic capacity. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=48904 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:4:y:2012:i:4:p:439-452

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().