Reliability evaluation of network flows with stochastic capacity and cost constraint
by H. Salehi Fathabadi; M. Khodaei
International Journal of Mathematics in Operational Research (IJMOR), Vol. 4, No. 4, 2012

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.

Online publication date: Tue, 23-Dec-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com