Improved Snake Optimization Algorithm for Global Optimization and Engineering Applications

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.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2025-05-25
DOI
https://doi.org/10.1038/s41598-025-01299-2
Citations
1
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improved Snake Optimization Algorithm for Global Optimization and Engineering Applications

Huiyong Liu, Bencheng Li, Kaiyuan Zheng
1 citations
Scientific Reports
Metaheuristic Optimization Algorithms Research
2.48
article

Improved Snake Optimization Algorithm for Global Optimization and Engineering Applications

Huiyong Liu, Bencheng Li, Kaiyuan Zheng
article en
1 citations

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.

Scientific ReportsVol. 15(1)
Beijing Information Science & Technology University (CN), Beihang University (CN)
Openalex Percentile: Top 10%
Metaheuristic Optimization Algorithms Research
2.48
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.