A critical assessment of some variants of particle swarm optimization

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

Abstract

Among the variants of the basic Particle Swarm Optimization (PSO) algorithm as first proposed in 1995, EPSO (Evolutionary PSO), proposed by Miranda and Fonseca, seems to produce significant improvements. We analyze the effects of two modifications introduced in that work (adaptive parameter setting and selection based on an evolution strategies-like approach) separately, reporting results obtained on a set of multimodal benchmark functions, which show that they may have opposite and complementary effects. In particular, using only parameter adaptation when optimizing 'harder' functions yields better results than when both modifications are applied. We also propose a justification for this, based on recent analyses in which particle swarm optimizers are studied as dynamical systems. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Cagnoni, S., Vanneschi, L., Azzini, A., & Tettamanzi, A. G. B. (2008). A critical assessment of some variants of particle swarm optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4974 LNCS, pp. 565–574). Springer Verlag. https://doi.org/10.1007/978-3-540-78761-7_62

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