GRACE-PSO: Particle Swarm Optimization with Group Rank Assessment and Cooperative Evolution

Particle swarm optimization (PSO) is a widely used bio-inspired optimization method. However, global guidance can align particle trajectories, reduce population diversity, and lead to premature convergence. To address this issue, we propose GRACE-PSO, a particle swarm optimizer based on group rank assessment and cooperative evolution. The method introduces group-best learning as an intermediate layer between personal-best and global-best learning to improve the balance between exploration and exploitation. GRACE-PSO integrates three coupled mechanisms: (1) a group-learning update that provides the population with multiple group-specific search directions; (2) a rank-based group-utility assessment that evaluates relative search effectiveness through pairwise comparisons of personal-best fitness values; and (3) a utility-driven adaptive strategy that adjusts the strengths of group-best and global-best learning and selectively reinitializes a small number of underperforming particles in stagnant groups. Experiments on 29 CEC 2017 benchmark functions at 30 and 50 dimensions against seven representative PSO methods show that GRACE-PSO achieves average ranks of 1.2414 and 1.3793, respectively. Experiments on two practical flexible intelligent metasurface optimization problems further demonstrate its competitive performance and practical applicability.

Authors

Institutions

Publication Details

Journal
Biomimetics
Published
2026-09-16
DOI
https://doi.org/10.3390/biomimetics11090664
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

GRACE-PSO: Particle Swarm Optimization with Group Rank Assessment and Cooperative Evolution

Lidong Gu, Pengyu Wang, Yufei Zhang, Jinxiao Li et al.
Biomimetics
Metaheuristic Optimization Algorithms Research
article

GRACE-PSO: Particle Swarm Optimization with Group Rank Assessment and Cooperative Evolution

Lidong Gu, Pengyu Wang, Yufei Zhang, Jinxiao Li, Honggang Wu
article en

Abstract

Particle swarm optimization (PSO) is a widely used bio-inspired optimization method. However, global guidance can align particle trajectories, reduce population diversity, and lead to premature convergence. To address this issue, we propose GRACE-PSO, a particle swarm optimizer based on group rank assessment and cooperative evolution. The method introduces group-best learning as an intermediate layer between personal-best and global-best learning to improve the balance between exploration and exploitation. GRACE-PSO integrates three coupled mechanisms: (1) a group-learning update that provides the population with multiple group-specific search directions; (2) a rank-based group-utility assessment that evaluates relative search effectiveness through pairwise comparisons of personal-best fitness values; and (3) a utility-driven adaptive strategy that adjusts the strengths of group-best and global-best learning and selectively reinitializes a small number of underperforming particles in stagnant groups. Experiments on 29 CEC 2017 benchmark functions at 30 and 50 dimensions against seven representative PSO methods show that GRACE-PSO achieves average ranks of 1.2414 and 1.3793, respectively. Experiments on two practical flexible intelligent metasurface optimization problems further demonstrate its competitive performance and practical applicability.

BiomimeticsVol. 11(9)
Changchun University of Science and Technology (CN), Jilin University (CN)
Openalex Percentile: Top 8%
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.