A Novel Multi-population Particle Swarm Optimization with Learning Patterns Evolved by Genetic Algorithm

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

Abstract

In recent years, particle swarm optimization (PSO) and genetic algorithm (GA) have been applied to solve various real-world problems. However, the original PSO is based on single population whose learning patterns (inertia weights, learning factors) has no potentials in evolution. All particles in the population interact and search according to a fixed pattern, which leads to the reduction of population diversity in the later iterations and premature convergence on complex and multi-modal problems. Therefore, a novel multi-population PSO with learning patterns evolved by GA is proposed to improve diversity and exploration capabilities of populations. Meanwhile, the local search of PSO particles which start in the same position also evolved by GA independently maintains exploitation ability inside each sub population. Experimental results show that the accuracy is comparable and our method improves the convergence speed.

Cite

CITATION STYLE

APA

Liu, C., Sun, F., Guo, Q., Wang, L., & Yang, B. (2018). A Novel Multi-population Particle Swarm Optimization with Learning Patterns Evolved by Genetic Algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10956 LNAI, pp. 70–80). Springer Verlag. https://doi.org/10.1007/978-3-319-95957-3_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