Minimal Path Sets Seismic Reliability Evaluation of Lifeline Networks with Link and Node Failures

A heuristic minimal path sets method for analyzing seismic reliability of lifeline networks is proposed. For large-scale lifeline networks reliability computation can become prohibitive or inaccurate using the current enumeration methods. Although a few studies have considered both node and link failures, none of these methods has utilized the minimal paths method. This paper proposes a minimal path algorithm to evaluate reliability of relatively large lifeline networks with unreliable nodes and links. As the primary task, the method can deduce all minimal paths of a directed/undirected network. In the algorithm, minimal paths for both nodes and links are traced performing several procedures. The terminal-pair reliability of the network is then evaluated by performing an efficient Monte Carlo simulation as an alternative to exact reliability calculation methods. In terms of computational speed, the results obtained compare well with existing algorithms. The algorithm requires minimum memory storage and minimum user-defined data to represent the topology of a network. A series of case studies illustrate that the method can be used to evaluate reliability of the large-scale lifeline systems subject to node and link failures, efficiently.

[1]  Antoine Rauzy,et al.  A brief introduction to Binary Decision Diagrams , 1996 .

[2]  Jun He,et al.  A recursive decomposition algorithm for network seismic reliability evaluation , 2002 .

[3]  D. Torrieri,et al.  Calculation of node-pair reliability in large networks with unreliable nodes , 1994 .

[4]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[5]  C. Jun,et al.  Some variants of polygon-to-chain reductions in evaluating reliability of undirected network , 1995 .

[6]  George S. Fishman A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness , 1986, IEEE Transactions on Reliability.

[7]  G. B. Jasmon,et al.  A New Technique in Minimal Path and Cutset Evaluation , 1985, IEEE Transactions on Reliability.

[8]  R. Billinton,et al.  An Efficient Algorithm for Deducing the Minimal Cuts and Reliability Indices of a General Network Configuration , 1976, IEEE Transactions on Reliability.

[9]  Amjed M. Al-Ghanim,et al.  A heuristic technique for generating minimal path and cutsets of a general network , 1999 .

[10]  Kenneth E. Case,et al.  A Method for Computing Complex System Reliability , 1972 .

[11]  Sheng-De Wang,et al.  Reliability evaluation for distributed computing networks with imperfect nodes , 1997 .

[12]  J.P. Gadani,et al.  System Effectiveness Evaluation Using Star and Delta Transformations , 1981, IEEE Transactions on Reliability.

[13]  John A. Buzacott,et al.  Improved Bounds for System-Failure Probability , 1987, IEEE Transactions on Reliability.

[14]  Suresh Rai,et al.  An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities , 2005, IEEE Transactions on Reliability.

[15]  V. A. Netes,et al.  Consideration of node failures in network-reliability calculation , 1996, IEEE Trans. Reliab..

[16]  Paul A. Jensen,et al.  An Algorithm to Determine the Reliability of a Complex System , 1969 .

[17]  David W. Coit,et al.  A Monte-Carlo simulation approach for approximating multi-state two-terminal reliability , 2005, Reliab. Eng. Syst. Saf..

[18]  Jacek Malinowski Non-binary decomposition trees - a method of reliability computation for systems with known minimal paths/cuts , 2004, Reliab. Eng. Syst. Saf..

[19]  K. B. Misra,et al.  An Algorithm for the Reliability Evaluation of Redundant Networks , 1970 .

[20]  Stephen Lemos,et al.  A New Technique , 2004, The American journal of sports medicine.

[21]  Jose Emmanuel Ramirez-Marquez,et al.  Element substitution algorithm for general two-terminal network reliability analyses , 2007 .

[22]  Sayeed Ahmad Simple enumeration of minimal cutsets of acyclic directed graph , 1988 .

[23]  S. Kuo,et al.  Determining terminal-pair reliability based on edge expansion diagrams using OBDD , 1999 .

[24]  W. J. Rueger Reliability Analysis of Networks with Capacity-Constraints and Failures at Branches & Nodes , 1986, IEEE Transactions on Reliability.

[25]  Roy Billinton,et al.  A novel approach to determine minimal tie-sets of complex network , 2004, IEEE Transactions on Reliability.