Improved Snake Optimization Algorithm for Global Optimization and Engineering Applications
Authors:
Open Access
- 25 May 2025
- journal article
- research article
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-48
Abstract
In engineering applications, many complex problems can be formulated as mathematical optimization challenges, and efficiently solving these problems is critical. Metaheuristic algorithms have proven highly effective in addressing a wide range of engineering issues. The Snake Optimization Algorithm (SO) is a novel metaheuristic method with widespread use. However, SO has limitations, including reduced search efficiency in later stages and a tendency to get trapped in local optima, preventing full exploration of the solution space. To overcome these, this paper introduces the Multi-strategy Improved Snake Optimization Algorithm (ISO), which integrates six key strategies. First, the Sobol sequence is used for population initialization, ensuring uniform distribution and enhancing global exploration. Second, the RIME algorithm accelerates convergence and improves exploitation. Lens reverse learning further promotes exploration, avoiding local optima. Levy flight facilitates large random steps, balancing exploration and refinement. Adaptive step-size adjustment dynamically tunes the step size based on fitness, optimizing exploration-exploitation. Lastly, the Brownian random walk introduces local perturbations to fine-tune solutions. These strategies collectively improve convergence speed, stability, and optimization capability, ensuring an effective balance between exploration and exploitation. The ISO population distribution was evaluated using three uniformity algorithms: Average Nearest Neighbor Distance, Star Discrepancy, and Sum of Squared Deviations (SSD). ISO demonstrated improvements of 63.08%, 26.09%, and 8.88%, respectively, over SO. Its exploration-exploitation balance and convergence were analyzed on the 30-dimensional CEC-2017 benchmark functions. Additionally, ISO was tested on 23 classic benchmark functions, CEC-2011, and CEC-2017 benchmark functions. Results showed ISO’s superior performance in convergence speed, stability, and global optimization. Furthermore, ISO was successfully applied in four engineering domains: UAV path planning, robot path planning, wireless sensor network node deployment, and pressure vessel design. In all cases, ISO outperformed SO with rapid convergence and strong robustness, achieving performance improvements of 5.69%, 34.61%, 20.73%, and 7.8%, respectively, underscoring its superior efficacy in practical applications.Keywords
This publication has 65 references indexed in Scilit:
- Draco lizard optimizer: a novel metaheuristic algorithm for global optimization problemsEvolutionary Intelligence, 2024
- Chaotic RIME optimization algorithm with adaptive mutualism for feature selection problemsComputers in Biology and Medicine, 2024
- SRIME: a strengthened RIME with Latin hypercube sampling and embedded distance-based selection for engineering optimization problemsNeural Computing and Applications, 2024
- A Compact Snake Optimization Algorithm in the Application of WKNN Fingerprint LocalizationSensors, 2023
- Salp swarm algorithm: a comprehensive surveyNeural Computing and Applications, 2019
- Genetic Algorithm2018
- Exploration and Exploitation Measurement in Swarm-Based Metaheuristic Algorithms: An Empirical Analysis2018
- Path Planning and Obstacle Avoidance for Autonomous Mobile Robots: A Review2006
- An Algorithm to Compute Bounds for the Star DiscrepancyJournal of Complexity, 2001
- A deterministic algorithm for global optimizationMathematical Programming, 1993