Towards a better understanding of the local attractor in particle swarm optimization: Speed and solution quality

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

Abstract

Particle Swarm Optimization (PSO) is a popular nature-inspired meta-heuristic for solving continuous optimization problems. Although this technique is widely used, the understanding of the mechanisms that make swarms so successful is still limited. We present the first substantial experimental investigation of the influence of the local attractor on the quality of exploration and exploitation. We compare in detail classical PSO with the social-only variant where local attractors are ignored. To measure the exploration capabilities, we determine how frequently both variants return results in the neighborhood of the global optimum. We measure the quality of exploitation by considering only function values from runs that reached a search point sufficiently close to the global optimum and then comparing in how many digits such values still deviate from the global minimum value. It turns out that the local attractor significantly improves the exploration, but sometimes reduces the quality of the exploitation. The effects mentioned can also be observed by measuring the potential of the swarm. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Lange, V., Schmitt, M., & Wanka, R. (2014). Towards a better understanding of the local attractor in particle swarm optimization: Speed and solution quality. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8779 LNAI, pp. 90–99). Springer Verlag. https://doi.org/10.1007/978-3-319-11298-5_10

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