A Particle Swarm Optimization Based on Dynamic Parameter Modification

Article Preview

Abstract:

A new particle swarm optimization based on dynamic parameter modification is proposed in this paper (Dynamic Parameter Modification Particle Swarm Optimizer, DPSO). In DPSO algorithm , is doing oscillating decay breaking through the constraint of topical linear decreasing, and the Euclidean distance and is calculated, which respectively stand for the Euclidean distances form the position of particle to the best position that the particle has passed and the best position that all the particles have passed under the time . Parameters and of topical PSO are modified dynamically based on the comparison of and in order to coordinate between global search and local search. Then find out the optimal value of Goldstein-Price function using topical PSO and the improved DPSO respectively, and the results demonstrate that compared to topical PSO, DPSO algorithm avoids falling into the local minimum and improves the search efficiency.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

201-205

Citation:

Online since:

November 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Zen Jian-chao,Jie Jing,Cui Zhi-hua. Particle Swarm Optimization [M]. Beijing:Science Press,2004-05.

Google Scholar

[2] Kennedy J. The particle swarm: Social adaptation of knowledge[A]. Proc IEEE Int Conf on Evolutionary Computation[C]. Indiamapolis, 1997. 303-308.

Google Scholar

[3] ZHAO Ya-min, XU Jia-dong. Modified particle swarm optimization algorithm [J]. Computer Engineering and Applications,2010,46(2):31-33.

Google Scholar

[4] CHEN Guo-chu, XU Yu-fa, LI Cheng-yang. Experimental Analysis of Parameters of Particle Swarm Optimization Algorithm [J]. Journal of Shanghai Dianji University,2007,10(2):86-92.

Google Scholar

[5] Suganthan P N. Particle swarm optimizer with neighborhood operator[C]∥Proceedings of the Congress on Evolutionary Computation. Piscataway: IEEE, 1999: 1 958-1 962.

Google Scholar