A hybrid multi-swarm PSO algorithm based on shuffled frog leaping algorithm

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

Abstract

As an effective swarm intelligence algorithm, multi-swarm particle swarm optimization (PSO) has better search ability than single-swarm PSO. In order to enhance the ability of group communication as well as improve the ability of local search, this paper proposes a hybrid multi-swarm PSO algorithm. Three strategies have been proposed, which are multi-swarm strategy, update strategy and cooperation strategy. A new way of grouping the particle swarms is put forward by calculating the fitness value of particles. In each group, the particles updates according to the formula which is morphed from the shuffled frog leaping algorithm. Moreover, a new information communication strategy is proposed. The cooperation of these three strategies maintains the diversity of algorithm and improves the ability of searching the optimal solution. Finally, the experimental results on the benchmark functions verify the effectiveness of the proposed PSO.

Cite

CITATION STYLE

APA

Bao, H., & Han, F. (2017). A hybrid multi-swarm PSO algorithm based on shuffled frog leaping algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10559 LNCS, pp. 101–112). Springer Verlag. https://doi.org/10.1007/978-3-319-67777-4_9

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