An electronic transition-based bare bones particle swarm optimization algorithm for high dimensional optimization problems

12Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

An electronic transition-based bare bones particle swarm optimization (ETBBPSO) algorithm is proposed in this paper. The ETBBPSO is designed to present high precision results for high dimensional single-objective optimization problems. Particles in the ETBBPSO are divided into different orbits. A transition operator is proposed to enhance the global search ability of ETBBPSO. The transition behavior of particles gives the swarm more chance to escape from local minimums. In addition, an orbit merge operator is proposed in this paper. An orbit with low search ability will be merged by an orbit with high search ability. Extensive experiments with CEC2014 and CEC2020 are evaluated with ETBBPSO. Four famous population-based algorithms are also selected in the control group. Experimental results prove that ETBBPSO can present high precision results for high dimensional single-objective optimization problems.

Cite

CITATION STYLE

APA

Tian, H., Guo, J., Xiao, H., Yan, K., & Sato, Y. (2022). An electronic transition-based bare bones particle swarm optimization algorithm for high dimensional optimization problems. PLoS ONE, 17(7 July). https://doi.org/10.1371/journal.pone.0271925

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