An improved QPSO algorithm base on social learning and lévy flights

11Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The centre of the potential well of the quantum-behaviour particle swarm optimization (QPSO) is restricted to the super rectangle which is made up of the local optimal position and the global optimal position. The information sharing mechanism among particles is single, and the algorithm has the problems of premature convergence and low optimization efficiency. To solve this problem, an improved QPSO algorithm is proposed, which integrates social learning and Lévy flights (LSL-QPSO). Firstly, the social learning strategy is used to update the non-optimal particle and improve the global search ability. Then, the Lévy flights strategy is introduced to overcome the shortcoming of the low efficiency of the optimal particle in the social learning mechanism, and further improve the convergence accuracy and search efficiency of the algorithm. Finally, four typical Benchmark functions are tested. The results show that the convergence accuracy, search efficiency and universality of the LSL-QPSO algorithm are ahead of QPSO and other similar QPSO improved algorithms.

Cite

CITATION STYLE

APA

Yuan, X., Jin, P., & Zhou, G. (2018). An improved QPSO algorithm base on social learning and lévy flights. Systems Science and Control Engineering, 6(3), 364–373. https://doi.org/10.1080/21642583.2019.1566857

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