TY - JOUR

T1 - Performance index of a stochastic-flow network with node failure under the budget constraint

AU - Lin, Yi-Kuei

PY - 2007/2/1

Y1 - 2007/2/1

N2 - This paper deals with a stochastic-flow network in which each node and arc has a designated capacity, which will have different lower levels due to various partial and complete failures. We try to evaluate the probability that the maximum flow of the network is equal to the demand d without exceeding the budget B. Such a probability is treated as a performance index to measure the quality level of the network. A simple algorithm in terms of minimal cuts is first proposed to generate all upper boundary points for (d, B), and then the probability that the maximal flow is less than or equal to d can be calculated in terms of such points. The upper boundary point for (d, B) is a maximal vector, which represents the capacity of each component (arc or node), such that the maximum flow of the network under the budget B is d. The performance index can be calculated by repeating the proposed algorithm to obtain all upper boundary points for (d-1, B). A computer simulation example is shown to illustrate the solution procedure.

AB - This paper deals with a stochastic-flow network in which each node and arc has a designated capacity, which will have different lower levels due to various partial and complete failures. We try to evaluate the probability that the maximum flow of the network is equal to the demand d without exceeding the budget B. Such a probability is treated as a performance index to measure the quality level of the network. A simple algorithm in terms of minimal cuts is first proposed to generate all upper boundary points for (d, B), and then the probability that the maximal flow is less than or equal to d can be calculated in terms of such points. The upper boundary point for (d, B) is a maximal vector, which represents the capacity of each component (arc or node), such that the maximum flow of the network under the budget B is d. The performance index can be calculated by repeating the proposed algorithm to obtain all upper boundary points for (d-1, B). A computer simulation example is shown to illustrate the solution procedure.

KW - Budget

KW - Minimal cut

KW - Node failure

KW - Performance index

KW - Stochastic-flow network

KW - System reliability

UR - http://www.scopus.com/inward/record.url?scp=33846691208&partnerID=8YFLogxK

U2 - 10.1007/s00170-005-0287-3

DO - 10.1007/s00170-005-0287-3

M3 - Article

AN - SCOPUS:33846691208

VL - 31

SP - 1209

EP - 1216

JO - International Journal of Advanced Manufacturing Technology

JF - International Journal of Advanced Manufacturing Technology

SN - 0268-3768

IS - 11-12

ER -