Particle swarm optimization with Monte-Carlo simulation and hypothesis testing for network reliability problem

The performance of Monte-Carlo Simulation(MCS) is highly related to the number of simulation. This paper introduces a hypothesis testing technique and incorporated into a Particle Swarm Optimization(PSO) based Monte-Carlo Simulation(MCS) algorithm to solve the complex network reliability problem. The function of hypothesis testing technique is to reduce the dispensable simulation in network system reliability estimation. The proposed technique contains three components: hypothesis testing, network reliability calculation and PSO algorithm for finding solutions. The function of hypothesis testing is to abandon unpromising solutions; we use Monte-Carlo simulation to obtain network reliability; since the network reliability problem is NP-hard, PSO algorithm is applied. Since the execution time can be better decreased with the decrease of Confidence level of hypothesis testing in a range, but the solution becomes worse when the confidence level exceed a critical value, the experiment are carried out on different confidence levels for finding the critical value. The experimental results show that the proposed method can reduce the computational cost without any loss of its performance under a certain confidence level.

[1]  Alice E. Smith,et al.  An ant colony optimization algorithm for the redundancy allocation problem (RAP) , 2004, IEEE Transactions on Reliability.

[2]  Sung-Bae Cho,et al.  An efficient genetic algorithm with less fitness evaluation by clustering , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[3]  Gerardo Rubino,et al.  A Monte Carlo sampling plan for estimating diameter-dependent network parameters , 2012, 2012 IV International Congress on Ultra Modern Telecommunications and Control Systems.

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

[5]  Jun Zhang,et al.  A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems , 2010, IEEE Transactions on Evolutionary Computation.

[6]  Qingfu Zhang,et al.  A surrogate-assisted evolutionary algorithm for minimax optimization , 2010, IEEE Congress on Evolutionary Computation.

[7]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[8]  Wei-Chang Yeh,et al.  A MCS Based Neural Network Approach to Extract Network Approximate Reliability Function , 2007 .

[9]  Jun Zhang,et al.  Evolutionary Computation Meets Machine Learning: A Survey , 2011, IEEE Computational Intelligence Magazine.

[10]  Wei-Chang Yeh.  A MCS-RSM approach for network reliability to minimise the total cost , 2003 .

[11]  George S. Fishman.  A Monte Carlo Sampling Plan for Estimating Network Reliability , 1986, Oper. Res..

[12]  Wei-Chang Yeh,et al.  A Particle Swarm Optimization Approach Based on Monte Carlo Simulation for Solving the Complex Network Reliability Problem , 2010, IEEE Transactions on Reliability.

[13]  I. Barany,et al.  Central limit theorems for Gaussian polytopes , 2006 .

[14]  Wei-neng Chen,et al.  A Monte-Carlo ant colony system for scheduling multi-mode projects with uncertainties to optimize cash flows , 2010, IEEE Congress on Evolutionary Computation.

[15]  Bernhard Sendhoff,et al.  Reducing Fitness Evaluations Using Clustering Techniques and Neural Network Ensembles , 2004, GECCO.

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

[17]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[18]  Oren Eliezer,et al.  Sequential Frame Synchronization Based on Hypothesis Testing With Unknown Channel State Information , 2015, IEEE Transactions on Communications.

[19]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[20]  M. Kendall.  Elementary Statistics , 1945, Nature.

[21]  Ying Lin,et al.  Particle Swarm Optimization With an Aging Leader and Challengers , 2013, IEEE Transactions on Evolutionary Computation.

[22]  Liang Zhang,et al.  A class of hypothesis-test-based genetic algorithms for flow shop scheduling with stochastic processing time , 2005 .

[23]  Hiromitsu Kumamoto,et al.  Efficient Evaluation of System Reliability by Monte Carlo Method , 1977, IEEE Transactions on Reliability.

[24]  E. Jamoulle,et al.  Transportation networks with random arc capacities , 1972 .

[25]  K. K. Aggarwal,et al.  A Simple Method for Reliability Evaluation of a Communication System , 1975, IEEE Trans. Commun..

[26]  W. Dixon,et al.  Introduction to Mathematical Statistics. , 1964 .

[27]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

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