Resampling in Particle Swarm Optimization

Particle Swarm Optimization (PSO) is a population-based algorithm designed to find good solutions to optimization problems. Its characteristics have encouraged its adoption to tackle a variety of problems in different fields. However, when such problems are subject to noise, the performance of PSO suffers an immediate deterioration which demands the incorporation of noise handling mechanisms. One such mechanism comprises resampling methods, which re-evaluate the solutions multiple times in order to estimate their true objective values. The state-of-the-art integration with which the best results have been obtained utilizes the resampling method named Optimal Computing Budget Allocation (OCBA). This resampling method starts by estimating the objective values of all the solutions via Equal Resampling (ER), and then sequentially allocating further re-evaluations to the estimated best solutions. However, after having a first estimate via ER, we question the importance of the additional efforts to correctly select the true best solutions when a good-enough and accurate one can be selected. In this paper, we propose a new PSO algorithm based on ER in which the additional evaluations are allocated at once to the estimated best solutions, thus skipping the complexity of using OCBA. Experiments on 20 large-scale benchmark functions subject to different levels of noise show that the proposed algorithm produces similar results to PSO with OCBA in most cases.

[1]  Thomas Bartz-Beielstein,et al.  Particle Swarm Optimization and Sequential Sampling in Noisy Environments , 2007, Metaheuristics.

[2]  Ling Wang,et al.  Particle swarm optimization for function optimization in noisy environment , 2006, Appl. Math. Comput..

[3]  Michael N. Vrahatis,et al.  PARTICLE SWARM OPTIMIZATION FOR IMPRECISE PROBLEMS , 2002 .

[4]  James Kennedy,et al.  The particle swarm: social adaptation of knowledge , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[5]  Anthony Di Pietro.  Optimising evolutionary strategies for problems with varying noise strength , 2007 .

[6]  Winston Khoon Guan Seah,et al.  A performance study on the effects of noise and evaporation in Particle Swarm Optimization , 2012, 2012 IEEE Congress on Evolutionary Computation.

[7]  Xiaodong Li,et al.  Benchmark Functions for the CEC'2010 Special Session and Competition on Large-Scale , 2009 .

[8]  Loo Hay Lee,et al.  Stochastic Simulation Optimization - An Optimal Computing Budget Allocation , 2010, System Engineering and Operations Research.

[9]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[10]  Loo Hay Lee,et al.  Simulation optimization using the Particle Swarm Optimization with optimal computing budget allocation , 2011, Proceedings of the 2011 Winter Simulation Conference (WSC).

[11]  Thomas Bartz-Beielstein,et al.  Sequential parameter optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.

[12]  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).

[13]  Jürgen Branke,et al.  Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.

[14]  Konstantinos E. Parsopoulos,et al.  PARTICLE SWARM OPTIMIZER IN NOISY AND CONTINUOUSLY CHANGING ENVIRONMENTS , 2001 .

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

[16]  Chun-Hung Chen,et al.  Simulation Budget Allocation for Further Enhancing the Efficiency of Ordinal Optimization , 2000, Discret. Event Dyn. Syst..

[17]  Chrysostomos D. Stylios,et al.  Integrating particle swarm optimization with reinforcement learning in noisy problems , 2012, GECCO '12.

[18]  Frans van den Bergh,et al.  An analysis of particle swarm optimizers , 2002 .

[19]  Riccardo Poli,et al.  Analysis of the publications on the applications of particle swarm optimisation , 2008 .