Variants of particle swarm optimization and onus of acceleration coefficients

ISSN: 22498958
3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

The Particle Swarm Optimization (PSO) is a widely used optimization algorithm for finding optimized solutions in a diverse gamut of problem domains. The parameters like Initialization, Constriction factor, Inertia Weight, Mutation Operator, Fuzzy Logic and Parallelism have engendered the Particle Swarm Optimization (PSO) with many variants. The variants of PSO have outperformed the Basic Particle Swarm Optimization. In order to comprehend the role of acceleration coefficients in BPSO, an inquiry is carried out. It is observed that the convergence speed of the BPSO is quicker when the acceleration coefficients are not equal than when both are equal.

Cite

CITATION STYLE

APA

Naga Pawan, Y. V. R., & Prakash, K. B. (2019). Variants of particle swarm optimization and onus of acceleration coefficients. International Journal of Engineering and Advanced Technology, 8(5), 1527–1538.

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