Performance evaluation of approximated artificial neural network (AANN) algorithm for reliability improvement

作者: Baijnath Kaushik , Haider Banka

DOI: 10.1016/J.ASOC.2014.10.002

关键词:

摘要: Approximated artificial neural network (AANN) is a meta-heuristics optimization algorithm mixing the features of approximating computed combinatorial spectrum and ability to approximate input from problem domain desired output. This paper proposes use an approximated approach for case reliability when complex design considered. A mesh 256 nodes hyper-tree 496 are considered evaluating performance AANN improving minimizing cost network. Since, using formal requires substantial computational effort time equivalent NP-Hard. The work presented in this compares with that Monte Carlo simulation (MCS) particle swarm (PSO) problems. results show comparable those mentioned algorithms can be used improve reduce problems amount complexity relatively higher.

参考文章(41)
James B. Orlin, Thomas L. Magnanti, Ravindra K. Ahuja, Network Flows: Theory, Algorithms, and Applications ,(1993)
Chat Srivaree-ratana, Abdullah Konak, Alice E. Smith, Estimation of all-terminal network reliability using an artificial neural network Computers & Operations Research. ,vol. 29, pp. 849- 868 ,(2002) , 10.1016/S0305-0548(00)00088-5
Satish J. Kamat, William E. Franzmeier, Determination of Reliability Using Event-Based Monte Carlo Simulation Part II IEEE Transactions on Reliability. ,vol. R-25, pp. 254- 255 ,(1976) , 10.1109/TR.1976.5219984
Malcolm C. Easton, C.K. Wong, Sequential Destruction Method for Monte Carlo Evaluation of System Reliability IEEE Transactions on Reliability. ,vol. R-29, pp. 27- 32 ,(1980) , 10.1109/TR.1980.5220696
K.K. Aggarwal, Suresh Rai, Reliability Evaluation in Computer-Communication Networks IEEE Transactions on Reliability. ,vol. R-30, pp. 32- 35 ,(1981) , 10.1109/TR.1981.5220952
Tongdan Jin, David W. Coit, Approximating network reliability estimates using linear and quadratic unreliability of minimal cuts Reliability Engineering & System Safety. ,vol. 82, pp. 41- 48 ,(2003) , 10.1016/S0951-8320(03)00117-0
J. Scott Provan, Michael O. Ball, The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected SIAM Journal on Computing. ,vol. 12, pp. 777- 788 ,(1983) , 10.1137/0212053
T. Elperin, I. Gertsbakh, M. Lomonosov, An Evolution Model for Monte Carlo Estimation of Equilibrium Network Renewal Parameters Probability in the Engineering and Informational Sciences. ,vol. 6, pp. 457- 469 ,(1992) , 10.1017/S0269964800002679
K. Aggarwal, J. Gupta, K. Misra, A Simple Method for Reliability Evaluation of a Communication System IEEE Transactions on Communications. ,vol. 23, pp. 563- 566 ,(1975) , 10.1109/TCOM.1975.1092838