A Bare-Bones Particle Swarm Optimization With Crossed Memory for Global Optimization
The offspring selection strategy is the core of evolutionary algorithms, which directly affects the method’s accuracy. Normally, to improve the search accuracy in local areas, the population converges quickly around the optimal individual. However, excessive aggregation can narrow the sea...
Main Authors: | Jia Guo, Guoyuan Zhou, Yi Di, Binghua Shi, Ke Yan, Yuji Sato |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10056156/ |
Similar Items
-
A Twinning Memory Bare-Bones Particle Swarm Optimization Algorithm for No-Linear Functions
by: Haiyang Xiao, et al.
Published: (2023-01-01) -
A Pair-wise Bare Bones Particle Swarm Optimization Algorithm for Nonlinear Functions
by: Jia Guo, et al.
Published: (2017-06-01) -
Bare bones particle swarm optimization with adaptive chaotic jump for feature selection in classification
by: Chenye Qiu
Published: (2018-01-01) -
A Fast-Converging Particle Swarm Optimization through Targeted, Position-Mutated, Elitism (PSO-TPME)
by: Tamir Shaqarin, et al.
Published: (2023-01-01) -
Bare-Bones Multiobjective Particle Swarm Optimization Based on Parallel Cell Balanceable Fitness Estimation
by: Junfei Qiao, et al.
Published: (2018-01-01)