| Περιγραφή: |
As optimization tasks become increasingly complex, particularly in feature selection, there is a growing need for algorithms capable of robustly balancing exploration and exploitation. In this work, we propose the Binary Swordfish Movement Optimization Algorithm (BSMOA), inspired by the synchronized and agile movements of swordfish. BSMOA employs adaptive parameters to navigate high-dimensional search spaces through dynamic exploration, exploitation, and elimination stages. Extensive experiments on benchmark datasets demonstrate that BSMOA outperforms state-of-the-art algorithms, including bHHO, bGWO, and bPSO, regarding average error, feature reduction, and computational efficiency. Key contributions of BSMOA include its improved balance between global and local search and its ability to achieve stable and accurate feature selection. This work has broad implications for applications in machine learning, engineering design, and other optimization domains, providing a reliable tool for tackling challenging binary optimization problems. |