A new multi-swarms competitive particle swarm optimization algorithm

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

Abstract

This paper presents the use of fuzzy C means clustering on swarms adaptive division, and proposes a multi-swarms competitive PSO(MSCPSO) algorithm based on fuzzy C means clustering. According to the scale of the swarms to select different optimal strategies, the swarm of large scale (can set the swarm scale threshold to estimate) uses the standard particle swarm algorithm to optimize, and the swarm of small scale randomly searches in the optimal solution neighborhood, increasing the probability of jumping out of the local optimization. Within every clustering, individuals communicate with each other, respectively finding the adaptive value of every clustering swarm by competitive learning and arranging the order according to the adaptive value of different clustering, and then the swarm of small adaptive value integrates with the neighboring swarm of large adaptive value, ensuring the particle swarms to search towards the optimal solution by the competition in the swarms, which increases the diversity of the swarms. This algorithm avoids getting into the local optimization and improves the global search capability. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Xia, L., Chu, J., & Geng, Z. (2012). A new multi-swarms competitive particle swarm optimization algorithm. In Lecture Notes in Electrical Engineering (Vol. 136 LNEE, pp. 133–140). https://doi.org/10.1007/978-3-642-26001-8_18

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