PSO based on cartesian coordinate system

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In order to deal with the problems of the slow convergence and easily converging to local optima, a classification learning PSO is proposed based on hyperspherical coordinates. The method of determination of poor performance particle is presented, and the swarm is divided into three parts where three learning strategies are introduced to improve the swarm to escape from local optima. Additionally, to decrease outside disturbance, the particle positions and velocities are updated in hyperspherical coordinate system, which improve the probability flying to the optimal solution. The simulation experiments of three typical functions are conducted, and the results show the effectiveness of the proposed algorithm. Consequently, CLPSO-HC can be used as an effective algorithm to solve complex multimodal problems. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Liu, Y., Zhang, Z., Luo, Y., & Wu, X. (2014). PSO based on cartesian coordinate system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8590 LNBI, pp. 363–370). Springer Verlag. https://doi.org/10.1007/978-3-319-09330-7_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free