Improved Superb Fairy-Wren Optimization Algorithm and Its Application

The Superb Fairy-wren Optimization Algorithm (SFOA) is a meta-heuristic algorithm inspired by the behavior of the superb fairy-wren. However, the conventional SFOA tends to converge to local optima and exhibits limited convergence accuracy when addressing complex optimization problems. To overcome these drawbacks, this study proposes an Improved Superb Fairy-wren Optimization Algorithm (ISFOA). The ISFOA incorporates four strategies-Chebyshev chaotic mapping, an adaptive weighting factor, Cauchy-Gaussian mutation, and t-distribution perturbation-to enhance the algorithm's ability to balance global exploration and local exploitation. An ablation study using the CEC 2021 test suite was performed to evaluate the individual contribution of each strategy. Moreover, to comprehensively assess the performance of ISFOA, a comparative analysis was carried out against eight other meta-heuristic algorithms on both the CEC2005 and CEC2021 benchmark function sets. Additionally, the practical applicability of ISFOA was examined by comparing it with eight other optimization algorithms across seven engineering design problems. The comprehensive experimental results indicate that ISFOA outperforms the original SFOA and other compared algorithms in terms of robustness and convergence accuracy, thereby offering an efficient and reliable approach for solving complex optimization problems.

Authors

Institutions

Publication Details

Journal
Biomimetics
Published
2026-02-01
DOI
https://doi.org/10.3390/biomimetics11020093
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
OCT
article

Improved Superb Fairy-Wren Optimization Algorithm and Its Application

Zhe Wu, Hao Lv, Qiang Zhang, Yanping Cui et al.
Biomimetics
Metaheuristic Optimization Algorithms Research
article

Improved Superb Fairy-Wren Optimization Algorithm and Its Application

Zhe Wu, Hao Lv, Qiang Zhang, Yanping Cui, Yachao Cao
article en

Abstract

The Superb Fairy-wren Optimization Algorithm (SFOA) is a meta-heuristic algorithm inspired by the behavior of the superb fairy-wren. However, the conventional SFOA tends to converge to local optima and exhibits limited convergence accuracy when addressing complex optimization problems. To overcome these drawbacks, this study proposes an Improved Superb Fairy-wren Optimization Algorithm (ISFOA). The ISFOA incorporates four strategies-Chebyshev chaotic mapping, an adaptive weighting factor, Cauchy-Gaussian mutation, and t-distribution perturbation-to enhance the algorithm's ability to balance global exploration and local exploitation. An ablation study using the CEC 2021 test suite was performed to evaluate the individual contribution of each strategy. Moreover, to comprehensively assess the performance of ISFOA, a comparative analysis was carried out against eight other meta-heuristic algorithms on both the CEC2005 and CEC2021 benchmark function sets. Additionally, the practical applicability of ISFOA was examined by comparing it with eight other optimization algorithms across seven engineering design problems. The comprehensive experimental results indicate that ISFOA outperforms the original SFOA and other compared algorithms in terms of robustness and convergence accuracy, thereby offering an efficient and reliable approach for solving complex optimization problems.

BiomimeticsVol. 11(2)
Hebei University of Science and Technology (CN), State Key Laboratory of Vehicle NVH and Safety Technology (CN)
Openalex Percentile: Top 72%
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.