Multi-level Competitive Swarm Optimizer for Large Scale Optimization

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

Abstract

In this paper, a new multi-level competitive swarm optimizer (MLCSO) is proposed for large scale optimization. As a variant of particle swarm optimization (PSO), MLCSO first divides the particles of original swarm into two groups randomly and then compares the particles according to their fitness values. The loser with worse fitness value will be put into the first level. The winner with better fitness becomes a new little swarm. New little swarm continues to be divided and compared until the new swarm has only one particle. This process forms a multi-level mechanism. The loser will be updated by the winner. It not only shows a great balance between exploration and exploitation but also enhances the diversity. 20 different kinds of test functions are selected for the experiments. Despite MLCSO algorithm is simple, the experimental results on high-dimension by comparing it with five state-of-the-art algorithms demonstrated its effectiveness.

Cite

CITATION STYLE

APA

Zhang, L., Zhu, Y., Zhong, S., Lan, R., & Luo, X. (2020). Multi-level Competitive Swarm Optimizer for Large Scale Optimization. In Advances in Intelligent Systems and Computing (Vol. 895, pp. 185–197). Springer Verlag. https://doi.org/10.1007/978-3-030-16946-6_15

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