A modified particle swarm optimizer with dynamic adaptation. (English) Zbl 1122.65364

Summary: A modified particle swarm optimization (PSO) algorithm with dynamic adaptation. In this algorithm, a modified velocity updating formula of the particle is used, where the randomness in the course of updating particle velocity is relatively decreased and the inertia weight of each particle is different. Moreover, this algorithm introduces two parameter describing the evolving state of the algorithm, the evolution speed factor and aggregation degree factor.
By analyzing the influence of two parameters on the PSO search ability, a new strategy is presented that the inertia weight dynamically changes based on the run and evolution state. In the strategy the inertia weight is given by a function of evolution speed factor and aggregation degree factor, and the value of inertia weight is dynamically adjusted according to the evolution speed and aggregation degree.
The feature of the proposed algorithm is analyzed and several testing functions are performed in simulation study. Experimental results show that, the proposed algorithm remarkably improves the ability of PSO to jump out of the local optima and significantly enhance the convergence precision.


65K05 Numerical mathematical programming methods
90C15 Stochastic programming
Full Text: DOI


[1] J. Kennedy, R.C. Eberhart, Particle Swarm optimization, in: Proc. of IEEE Int. Conf. on Neural Networks, Perth, Australia (1995) 1942-1948.
[2] J. Kennedy, R.C. Eberhart, A new optimizer using particle swarm theory, in: Proc. of the Sixth Int. Symp. on Micro Machine and Human Science (MHS’95), Nagoya, Japan (1995) 39-43.
[3] Y.H. Shi, R.C. Eberhart, Fuzzy Adaptive particle swarm optimization, in: Proc. of the IEEE Congress on Evolutionary Computation, vol. 1, Seoul Korea (2001) 101-106.
[4] Y.H. Shi, R.C. Eberhart, A modified particle swarm optimizer, in: Proc. of the IEEE Congress on Evolutionary Computation. IEEE Service Center, USA (1998) 69-73.
[5] Y.L. Zhang, L.H. Ma, L.Y. Zhang, J.X. Qian, On the Convergence Analysis and Parameter Selection in Panicle Swarm Optimization, in: Proc. Int. Conf. on Machine learning and Cybernetics. Zhejiang University, Hangzhou, China, (2003) 1802-1807.
[6] R.C. Eberhart, Y.H. Shi, Tracking and optimizing dynamic systems with particle swarms, in: Proc. of the IEEE Congress on Evolutionary Computation. San Francisco, USA (2001) 94-100.
[7] Zhang, L.P.; Yu, H.J.; Chen, D.Z.; Hu, S.X., Analysis and improvement of particle swarm optimization algorithm, Inform. control, 33, 513-517, (2004), Shengyang, China
[8] Zhang, X.P.; Du, Y.P.; Qin, G.Q., Adaptive particle swarm algorithm with dynamically changing inertia weight, J. Xian jiaotong univ., 39, 1039-1042, (2005) · Zbl 1097.90598
[9] Y.H. Shi, R.C. Eberhart, in: Proc. of Int. Conf. on Evolutionary Computation, Washington, USA (1999) 1945-1950.
[10] F. van den Bergh, An Analysis of Particle Swarm Optimizers. Ph.D. thesis. Department of Computer Science, University of Pretoria, Pretoria, South Africa, 2002.
[11] Li, A.G., Particle swarms cooperative optimizer, J. fudan univ. (natural science), 43, 923-925, (2004), ShangHai, China
[12] Chen, G.M.; Jia, J.Y.; Han, Q., Study on the strategy of decreasing inertia weight in particle swarm optimization algorithm, J. Xian jiaotong univ., 40, 1039-1042, (2006)
[13] Lu, Z.S.; Hou, Z.R., Particle swarm optimization with adaptive mutation, Acta electron. sinica, 32, 416-420, (2004), Beijing, China
[14] Pan, F.; Tu, X.Y.; Chen, J.; Fu, J.W., Harmonious particle swarm optimizer - HPSO, Comput. eng., 31, 169-171, (2005), Shanghai, China
[15] Yu Liu, Zheng Qin, Zhewen Shi, Jiang Lu, Center particle swarm optimization, Neurocomputing, doi:10.1016/j.neucom.2006.10.002. · Zbl 1200.90169
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.