Self adaptive acceleration factor in particle swarm optimization

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

Abstract

Particle swarm optimization (PSO), which is one of the leading swarm intelligence algorithms, dominates other optimization algorithms in some fields but, it also has the drawbacks like it easily falls into local optima and suffers from slow convergence in the later stages. This paper proposes improved version of PSO called Self Adaptive Acceleration Factors in PSO (SAAFPSO) to balance between exploration and exploitation. We converted the constant acceleration factors used in standard PSO into function of particle's fitness. If a particle is more fit then it gives more importance to global best particle and less to itself to avoid local convergence. In later stages, particles will be more fitter so all will move towards global best particle, thus achieved the convergence speed. Experiment is performed and compared with standard PSO and Artificial bee colony (ABC) on unbiased benchmark optimization functions and one real world engineering optimization problem (known as pressure vessel design) and results show that proposed algorithm SAAFPSO dominates others. © 2013 Springer.

Cite

CITATION STYLE

APA

Jadon, S. S., Sharma, H., Bansal, J. C., & Tiwari, R. (2013). Self adaptive acceleration factor in particle swarm optimization. In Advances in Intelligent Systems and Computing (Vol. 201 AISC, pp. 325–340). Springer Verlag. https://doi.org/10.1007/978-81-322-1038-2_28

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