A Comparison of Selected Modifications of the Particle Swarm Optimization Algorithm

Michala Jakubcová, Petr Máca and Pavel Pech

Journal of Applied Mathematics, 2014, vol. 2014, issue 1

Abstract: We compare 27 modifications of the original particle swarm optimization (PSO) algorithm. The analysis evaluated nine basic PSO types, which differ according to the swarm evolution as controlled by various inertia weights and constriction factor. Each of the basic PSO modifications was analyzed using three different distributed strategies. In the first strategy, the entire swarm population is considered as one unit (OC‐PSO), the second strategy periodically partitions the population into equally large complexes according to the particle’s functional value (SCE‐PSO), and the final strategy periodically splits the swarm population into complexes using random permutation (SCERand‐PSO). All variants are tested using 11 benchmark functions that were prepared for the special session on real‐parameter optimization of CEC 2005. It was found that the best modification of the PSO algorithm is a variant with adaptive inertia weight. The best distribution strategy is SCE‐PSO, which gives better results than do OC‐PSO and SCERand‐PSO for seven functions. The sphere function showed no significant difference between SCE‐PSO and SCERand‐PSO. It follows that a shuffling mechanism improves the optimization process.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/293087

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2014:y:2014:i:1:n:293087

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().