Affiliation:
1. Wenzhou University
2. Zhejiang Institute of Mechanical and Electrical Engineering
3. University of Tehran
4. Sichuan University
5. Wenzhou Polytechnic
Abstract
Abstract
The Slime Mould Algorithm (SMA), renowned for its swarm-based approach, encounters challenges, particularly in maintaining a balance between exploration and exploitation, leading to a trade-off that impacts its optimization performance. The simple structure and limited hyperparameters of SMA contribute to difficulties in effectively navigating the exploration-exploitation trade-off, with a drawback being its poor ability for exploration. To address these challenges and enhance SMA, this paper introduces BSSMA, an improved variant that incorporates the Backtracking Search Algorithm (BSA). The introduction of the \(phaseratio\) parameter aims to synergize BSA and SMA, capitalizing on the strengths of both algorithms while mitigating their individual drawbacks, including SMA's poor exploration ability. BSA facilitates a thorough exploration, dispersing search agents widely across the solution space, ensuring significant diversity. These search agents then transition to SMA to further refine the search for optimal solutions while addressing SMA's exploration limitations. Evaluating the performance of BSSMA involves comparisons with 12 other meta-heuristic algorithms (MAs) and 10 advanced MAs using the CEC2017 benchmark functions. Experimental results showcase that the enhanced BSSMA outperforms SMA in terms of convergence speed and accuracy, specifically addressing the challenges associated with balancing exploration and exploitation trade-offs, including SMA's poor exploration ability. Additionally, to demonstrate BSSMA's effectiveness in practical engineering applications, a binary version (bBSSMA) is developed for feature selection (FS) using a V-shaped transfer function. Comparative experiments with seven other binary MA variants reveal that bBSSMA selects fewer features, attains higher classification accuracy, and demands less computational time. These results affirm the effectiveness of bBSSMA for practical feature selection applications.
Publisher
Research Square Platform LLC
Reference99 articles.
1. Carrizosa E, Guerrero V, Romero Morales D (2019) Visualization complex dynamic datasets means Math Optim Omega 86:125–136
2. Gaur A et al (2017) Finding near-optimum and diverse solutions for a large-scale engineering design problem. : p. 1–8
3. Xue L (2021) Application of Mathematical Methods in Computer Algorithms Under the Background of Internet. 3
4. Optimizing process economics online using model predictive control;Amrit R;Comput Chem Eng,2013
5. A mathematical model for automatic differentiation in machine learning;Bolte J;Adv Neural Inf Process Syst,2020