Heuristic technique for generating minimal path and cutsets of a general network

Computers and Industrial Engineering

Volumn 36, Issue 1, 1999, Pages 45-55

  Al Ghanim, Amjed M ^a  

^a AN NAJAH NATIONAL UNIVERSITY   (Palestine)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; HEURISTIC METHODS; MATHEMATICAL PROGRAMMING; RELIABILITY; RESPONSE TIME (COMPUTER SYSTEMS); SYSTEMS ANALYSIS;

HEURISTIC PROGRAMMING METHOD; NETWORK-BASED RELIABILITY EVALUATION METHODS;

CRITICAL PATH ANALYSIS;

EID: 0032683528     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(98)00111-9     Document Type: Article

References (15)

1. Al-Ghanim A, Dalabieh D. Reliability evaluation of substation. In: Middle East Power System Conference MEPCON, Cairo, December 1989, pp. 305-9.
2. Billinton R, Allan RN. Reliability evaluation of engineering systems: concepts and techniques. Plenum Press, 1983.
3. Allan R.N., Billinton R., De Olveira M.F. An efficient algorithm for deducing the minimal cuts and reliability. Vol. R. 25:1976;226-233.
4. Awosope C.O.A., Akinbulare T.O. A computer program for generating power-system load point minimal paths. IEEE Trans. Reliab. 40:1991;302-308.
5. Belmore M., Jensen P. An implicit scheme for proper cutsets generation. Technometrics. 12:1970;775-788.
6. Jasmon G.B., Kai O.S. A new technique in minimal path and minimal cutset evaluation. IEEE Trans. Rel. R. 34:1985;136-143.
7. Jasmon G.B., Foong K.W. A method for evaluation all the minimal cuts of a graph. IEEE Trans. Reliab. R. 36:1987;539-545.
8. Arunkumar S., Lee S.H. Enumeration of all minimal cutsets for a pair node in a graph. IEEE Trans. Reliab. R. 28:1979;51-55.
9. Jensen P., Bellmore M. An algorithm to determine the reliability of a complex system. IEEE Trans. Reliab. R. 28:1969;169-174.
10. Locks M.O. Inventing and minimalizing pathsets and cutsets. IEEE Trans. Reliab. R. 27:1978;107-108.
11. Rai S., Aggarwal K.K. On complementation on pathsets cutsets. IEEE Trans. Reliab. R. 29:1980;139-140.
12. Hasenuddin S.A. Simple enumeration of minimal cut sets of acyclic directed graphs. IEEE Trans. Reliab. 37:1988;484-487.
13. Yoo Y.B., Deo N. A comparison of algorithms for terminal pair reliability. IEEE Trans. Reliab. 37 (June):1988;393-398.
14. Balabanian N, Bickart T. Linear network theory. OR: Matrix Publishers Inc.
15. Patvardhan C., Prasad V.C., Prem Pyara V. Vertex cutsets of undirected graphs. IEEE Trans. Reliab. 44(2):1995;347-353.