Quantum-behaved particle swarm optimization with weighted mean personal best position and adaptive local attractor

14Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

Motivated by concepts in quantum mechanics and particle swarm optimization (PSO), quantum-behaved particle swarm optimization (QPSO) was proposed as a variant of PSO with better global search ability. In this paper, a QPSO with weighted mean personal best position and adaptive local attractor (ALA-QPSO) is proposed to simultaneously enhance the search performance of QPSO and acquire good global optimal ability. In ALA-QPSO, the weighted mean personal best position is obtained by distinguishing the difference of the effect of the particles with different fitness, and the adaptive local attractor is calculated using the sum of squares of deviations of the particles' fitness values as the coefficient of the linear combination of the particle best known position and the entire swarm's best known position. The proposed ALA-QPSO algorithm is tested on twelve benchmark functions, and compared with the basic Artificial Bee Colony and the other four QPSO variants. Experimental results show that ALA-QPSO performs better than those compared method in all of the benchmark functions in terms of better global search capability and faster convergence rate.

Cite

CITATION STYLE

APA

Chen, S. (2019). Quantum-behaved particle swarm optimization with weighted mean personal best position and adaptive local attractor. Information (Switzerland), 10(1). https://doi.org/10.3390/info10010022

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