A Simple Heuristic Algorithm for Generating All Minimal Paths

Evaluating network reliability is an important topic in the planning, designing, and control of network systems. In this paper, an intuitive heuristic algorithm is developed to find all minimal paths (MP) by adding a path, or an edge into a network repeatedly until the network is equal to the original network. The proposed heuristic algorithm is easier to understand & implement than the existing known heuristic algorithm. Without generating any duplicate MP, it is also more efficient. The correctness of the proposed algorithm will be analysed, and proven. One bench example is illustrated to show how to evaluate the network reliability using the proposed heuristic algorithm.

[1]  Terje Aven,et al.  Availability evaluation of oil/gas production and transportation systems , 1987 .

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

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

[4]  Wei-Chang Yeh.  A simple algorithm to search for all d-MPs with unreliable nodes , 2001, Reliab. Eng. Syst. Saf..

[5]  Peter Kubat,et al.  Estimation of reliability for communication/computer networks simulation/analytic approach , 1989, IEEE Trans. Commun..

[6]  Wei-Chang Yeh.  A simple approach to search for all d-MCs of a limited-flow network , 2001, Reliab. Eng. Syst. Saf..

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

[8]  Weiwe-Chang Yeh.  A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes , 2004, Reliab. Eng. Syst. Saf..

[9]  Wei-Chang Yeh,et al.  A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network , 1998 .

[10]  Wei-Chang Yeh.  A simple algorithm to search for all MCs in networks , 2006, Eur. J. Oper. Res..

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

[12]  Ming Jian Zuo,et al.  Dominant multi-state systems , 2004, IEEE Transactions on Reliability.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Wei-Chang Yeh.  Search for MC in modified networks , 2001, Comput. Oper. Res..

[15]  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..

[16]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[17]  M. Samad,et al.  An efficient algorithm for simultaneously deducing minimal paths as well as cuts of a communication network , 1987 .

[18]  Zhibin Tan.  Minimal cut sets of s-t networks with k-out-of-n nodes , 2003, Reliab. Eng. Syst. Saf..

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

[20]  Tongdan Jin,et al.  Approximating network reliability estimates using linear and quadratic unreliability of minimal cuts , 2003, Reliab. Eng. Syst. Saf..

[21]  Sieteng Soh,et al.  A computer approach for reliability evaluation of telecommunication networks with heterogeneous link-capacities , 1991 .

[22]  Wei-Chang Yeh.  Search for minimal paths in modified networks , 2002, Reliab. Eng. Syst. Saf..

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

[24]  Terje Aven,et al.  Some considerations on reliability theory and its applications , 1988 .

[25]  Wei-Chang Yeh.  Multistate-node acyclic networks reliability evaluation based on MC , 2003, Reliab. Eng. Syst. Saf..

[26]  J. M. Nahman.  Enumeration of minimal cuts of modified networks , 1994 .