Growing Particle Swarm Optimizers with a Population-Dependent Parameter

This paper studies a new version of growing particle swarm optimizers. In the algorithm, a new particle is born if a particle exploring the optimum is stagnated and the swarm can grow depending on problem complexity. The particle velocity is controlled by an acceleration parameter that can attenuate depending on the number of particles and can vibrate depending on the time. The parameter plays important role to reduce the computation cost and to increase the success rate. The algorithm efficiency is confirmed by numerical experiments of typical benchmarks.

[1]  José Neves,et al.  The fully informed particle swarm: simpler, maybe better , 2004, IEEE Transactions on Evolutionary Computation.

[2]  Alan Godoy,et al.  A Complex Neighborhood based Particle Swarm Optimization , 2009, 2009 IEEE Congress on Evolutionary Computation.

[3]  A. Engelbrecht,et al.  Using vector operations to identify niches for particle swarm optimization , 2004, IEEE Conference on Cybernetics and Intelligent Systems, 2004..

[4]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[5]  Shiu Yin Yuen,et al.  A non-revisiting particle swarm optimization , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[6]  Toshimichi Saito,et al.  Particle swarm optimizers with grow-and-reduce structure , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[7]  Xiaodong Li,et al.  This article has been accepted for inclusion in a future issue. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 Locating and Tracking Multiple Dynamic Optima by a Particle Swarm Model Using Speciation , 2022 .

[8]  Taufik Abrão,et al.  Particle swarm optimization assisted multiuser detector for M-QAM DS/CDMA systems , 2008, 2008 IEEE Swarm Intelligence Symposium.

[9]  Michael N. Vrahatis,et al.  On the computation of all global minimizers through particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[10]  Alexandre R. S. Romariz,et al.  Digital filter arbitrary magnitude and phase approximations - statistical analysis applied to a stochastic-based optimization approach , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[11]  Salman Mohagheghi,et al.  Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems , 2008, IEEE Transactions on Evolutionary Computation.

[12]  Juan Humberto Sossa Azuela,et al.  Design of artificial neural networks using a modified Particle Swarm Optimization algorithm , 2009, 2009 International Joint Conference on Neural Networks.

[13]  Toshio Fukuda,et al.  A PSO-based Mobile Sensor Network for Odor Source Localization in Dynamic Environment: Theory, Simulation and Measurement , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[14]  Toshimichi Saito,et al.  Application of particle swarm optimizers to two-objective problems in design of switching inverters , 2009, 2009 International Joint Conference on Neural Networks.

[15]  Tsung-Ying Sun,et al.  Effective Learning Rate Adjustment of Blind Source Separation Based on an Improved Particle Swarm Optimizer , 2008, IEEE Transactions on Evolutionary Computation.

[16]  Andries Petrus Engelbrecht,et al.  Training neural networks with PSO in dynamic environments , 2009, 2009 IEEE Congress on Evolutionary Computation.

[17]  J. Kennedy,et al.  Population structure and particle swarm performance , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[18]  Toshimichi Saito,et al.  Particle Swarm Optimizers with Growing Tree Topology , 2009, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..