Reliability evaluation of multi-state systems under cost consideration

Abstract A more practical and desirable performance index of multi-state systems is the two-terminal reliability for level ( d ,  c ) (2TR d , c ), defined as the probability that d units of flow can be transmitted from the source node to the sink node with the total cost less than or equal to c . In this article, a simple algorithm is developed to calculate 2TR d , c in terms of ( d ,  c )-MPs. Two major advantages of the proposed algorithm include: (1) as of now, it is the only algorithm that searches for ( d ,  c )-MPs without requiring all minimal paths (MPs) and the procedure of transforming feasible solutions; (2) it is more practical and efficient in solving ( d ,  c )-MP problem in contrast to the best-known method. An example is provided to illustrate the generation of ( d ,  c )-MPs by using the presented algorithm, and 2TR d , c is thus evaluated. Furthermore, the computational experiments are conducted to verify the performance of the presented algorithm.

[1]  John Yuan,et al.  Reliability evaluation of a limited-flow network in terms of minimal cutsets , 1993 .

[2]  Wei-Chang Yeh A Simple Method to Verify All d-Minimal Path Candidates of a Limited-Flow Network and its Reliability , 2002 .

[3]  Chin-Chia Jane,et al.  A Practical Algorithm for Computing Multi-State Two-Terminal Reliability , 2008, IEEE Transactions on Reliability.

[4]  Yi-Kuei Lin,et al.  Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs , 2002, Reliab. Eng. Syst. Saf..

[5]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[6]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[7]  Yi-Kuei Lin,et al.  A simple algorithm for reliability evaluation of a stochastic-flow network with node failure , 2001, Comput. Oper. Res..

[8]  Ravindra K. Ahuja,et al.  Computational investigations of maximum flow algorithms , 1997 .

[9]  Wei-Chang Yeh A Fast Algorithm for Searching All Multi-State Minimal Cuts , 2008, IEEE Transactions on Reliability.

[10]  W.-C. Yeh A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance , 2005, J. Oper. Res. Soc..

[11]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[12]  Yi-Kuei Lin,et al.  Reliability of a stochastic-flow network with unreliable branches & nodes, under budget constraints , 2004, IEEE Trans. Reliab..

[13]  Jsen-Shung Lin,et al.  Reliability evaluation of capacitated-flow networks with budget constraints , 1998 .

[14]  Meng Qian,et al.  Improving efficiency of solving d-MC problem in stochastic-flow network , 2007, Reliab. Eng. Syst. Saf..

[15]  Wei-Chang Yeh A new approach to evaluate reliability of multistate networks under the cost constraint , 2005 .

[16]  Michael O. Ball,et al.  Computational Complexity of Network Reliability Analysis: An Overview , 1986, IEEE Transactions on Reliability.

[17]  Chin-Chia Jane,et al.  On reliability evaluation of a capacitated-flow network in terms of minimal pathsets , 1995, Networks.

[18]  David W. Coit,et al.  A generalized multistate-based path vector approach to multistate two-terminal reliability , 2006 .

[19]  S. Satitsatian,et al.  An algorithm for lower reliability bounds of multistate two-terminal networks , 2006, IEEE Transactions on Reliability.

[20]  C. Jane,et al.  Algorithms to determine the threshold reliability of flow networks , 2004 .