A Random Particle Swarm Optimization Algorithm with Application

Article Preview

Abstract:

To improve the efficiency of particle swarm optimization, a random particle swarm optimization algorithm is proposed on the basis of analyzing the search process of quantum particle swarm optimization algorithm. The proposed algorithm has only a parameter, and its search step length is controlled by a random variable value. In this model, the target position can be accurately tracked by the reasonable design of the control parameter. The experimental results of standard test function extreme optimization and clustering optimization show that the proposed algorithm is superior to the quantum particle swarm optimization and the common particle swarm optimization algorithm in optimization ability and optimization efficiency.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 634-638)

Pages:

3940-3944

Citation:

Online since:

January 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Kennedy J, Eberhart R C. Proc. of IEEE international conference on Neural Networks. USA: IEEE Press, 1995: 1942-(1948).

Google Scholar

[2] Lin S W, Ying K C, Chen S C, et al. Expert Systems with Applications, 2008, 35(4): 1817-1824.

Google Scholar

[3] Cai X J, Cui Z H, Zeng J C, et al. Information Processing Letters, 2008, 105(6): 231-235.

Google Scholar

[4] Liu Y, Qin Z, Shi Z W, et al. Neurocomputing, 2007, 70(4-6): 672-679.

Google Scholar

[5] Fang W, Sun J, Xie Z P, et al. Physics Journal (In Chinese). 2010, 59(6): 3686-3694.

Google Scholar

[6] Shuqing Zhao, Wei Zheng. Harbin Industrial University Press(In Chinese). 1999: 54-56.

Google Scholar