Multi-Strategy Improved Red-Billed Blue Magpie Optimization Algorithm and Its Applications

To address the issues of low convergence accuracy, poor population diversity, and susceptibility to local optima in the Red-billed Blue Magpie Optimization Algorithm (RBMO), this study proposes a multi-strategy improved Red-billed Blue Magpie Optimization Algorithm (SWRBMO). First, an adaptive T-distribution-based sinh–cosh search strategy is used to enhance global exploration and speed up convergence. Second, a neighborhood-guided reinforcement strategy helps the algorithm avoid local optima. Third, a crossover strategy is also introduced to improve convergence accuracy. SWRBMO is evaluated on 15 benchmark functions selected from the CEC2005 test suite, with ablation studies on 12 of them, and further validated on the CEC2019 and CEC2021 test suites. Across all test sets, its convergence behavior and statistical significance are analyzed using the Wilcoxon rank-sum test. Comparative experiments on CEC2019 and CEC2021 demonstrate that SWRBMO achieves faster convergence and higher accuracy than RBMO and other competitive algorithms. Finally, four engineering design problems further confirm its practicality, where SWRBMO outperforms other methods by up to 99%, 38.4%, 2.4%, and nearly 100% in the respective cases, highlighting its strong potential for real-world engineering applications.