A parameter selection strategy for particle swarm optimization based on particle positions

A relationship between the dynamic process of PSO and the transition process is proposed.A novel parameter strategy for PSO is proven using the overshoot and the peak time.The parameters obtained from our strategy are coincided with the published results.The new strategy is applied to equally spaced linear array synthesis examples. In this study, we found that engineering experience can be used to determine the parameters of an optimization algorithm. We came to this conclusion by analyzing the dynamic characteristics of PSO through a large number of experiments. We constructed a relationship between the dynamic process of particle swarm optimization and the transition process of a control system. A novel parameter strategy for PSO was proven in this paper using the overshoot and the peak time of a transition process. This strategy not only provides a series of flexible parameters for PSO but it also provides a new way to analyze particle trajectories that incorporates engineering practices. In order to validate the new strategy, we compared it with published results from three previous reports, which are consistent or approximately consistent with our new strategy, using a suite of well-known benchmark optimization functions. The experimental results show that the proposed strategy is effective and easy to implement. Moreover, the new strategy was applied to equally spaced linear array synthesis examples and compared with other optimization methods. Experimental results show that it performed well in pattern synthesis.

[1]  J. F. Martínez,et al.  The generalized PSO: a new door to PSO evolution , 2008 .

[2]  Taher Niknam,et al.  An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis , 2010, Appl. Soft Comput..

[3]  Wenbo Xu,et al.  An improved quantum-behaved particle swarm optimization algorithm with weighted mean best position , 2008, Appl. Math. Comput..

[4]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[5]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[6]  Fan Yu A Hybrid Optimized Algorithm Based on Differential Evolution and Genetic Algorithm and Its Applications in Pattern Synthesis of Antenna Arrays , 2004 .

[7]  S. Moorthi,et al.  Implementation of hybrid ANN-PSO algorithm on FPGA for harmonic estimation , 2012, Eng. Appl. Artif. Intell..

[8]  Andrew J. Chipperfield,et al.  Simplifying Particle Swarm Optimization , 2010, Appl. Soft Comput..

[9]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[10]  Zengqiang Chen,et al.  Chaos particle swarm optimization and T-S fuzzy modeling approaches to constrained predictive control , 2012, Expert Syst. Appl..

[11]  Shiyuan Yang,et al.  Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm , 2007, Inf. Process. Lett..

[12]  Katsuhiko Ogata,et al.  Modern Control Engineering , 1970 .

[13]  Ying-ping Chen,et al.  Analysis of particle interaction in particle swarm optimization , 2010, Theor. Comput. Sci..

[14]  Guohai Liu,et al.  Randomization in particle swarm optimization for global search ability , 2011, Expert Syst. Appl..

[15]  Xia Li,et al.  A novel particle swarm optimizer hybridized with extremal optimization , 2010, Appl. Soft Comput..

[16]  Xiaojun Wu,et al.  Convergence analysis and improvements of quantum-behaved particle swarm optimization , 2012, Inf. Sci..

[17]  James Kennedy,et al.  Bare bones particle swarms , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[18]  Manoj Kumar Tiwari,et al.  Swarm Intelligence, Focus on Ant and Particle Swarm Optimization , 2007 .

[19]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[20]  Jie Chen,et al.  Optimal Contraction Theorem for Exploration–Exploitation Tradeoff in Search and Optimization , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[21]  Oscar Castillo,et al.  Optimal design of fuzzy classification systems using PSO with dynamic parameter adaptation through fuzzy logic , 2013, Expert Syst. Appl..

[22]  James Kennedy,et al.  Probability and dynamics in the particle swarm , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

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

[24]  Yong Wang,et al.  Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization , 2010, Appl. Soft Comput..

[25]  Zhao Xinchao A perturbed particle swarm algorithm for numerical optimization , 2010 .

[26]  Ioan Cristian Trelea,et al.  The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..