Zheng Kaiyuan, Liu Huiyong, Li Bopeng
College of Computer Science, Beijing Information Science and Technology University, No. 55 Taihang Road, Changping District, 102206, Beijing, China.
Sci Rep. 2025 May 25;15(1):18171. doi: 10.1038/s41598-025-01299-2.
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.
在工程应用中,许多复杂问题可被表述为数学优化挑战,高效解决这些问题至关重要。元启发式算法已被证明在解决各类工程问题方面非常有效。蛇优化算法(SO)是一种广泛应用的新型元启发式方法。然而,SO存在局限性,包括后期搜索效率降低以及容易陷入局部最优,从而无法充分探索解空间。为克服这些问题,本文介绍了多策略改进蛇优化算法(ISO),该算法集成了六种关键策略。首先,使用索博尔序列进行种群初始化,确保均匀分布并增强全局探索。其次,RIME算法加速收敛并提高利用能力。透镜反向学习进一步促进探索,避免局部最优。莱维飞行有助于进行大的随机步长,平衡探索和细化。自适应步长调整根据适应度动态调整步长,优化探索-利用。最后,布朗随机游走引入局部扰动以微调解决方案。这些策略共同提高了收敛速度、稳定性和优化能力,确保在探索和利用之间实现有效平衡。使用三种均匀性算法对ISO种群分布进行了评估:平均最近邻距离、星偏差和平方偏差之和(SSD)。与SO相比,ISO分别展示出63.08%、26.09%和8.88%的改进。在30维CEC - 2017基准函数上分析了其探索-利用平衡和收敛性。此外,在23个经典基准函数、CEC - 2011和CEC - 2017基准函数上对ISO进行了测试。结果表明ISO在收敛速度、稳定性和全局优化方面具有卓越性能。此外,ISO成功应用于四个工程领域:无人机路径规划、机器人路径规划、无线传感器网络节点部署和压力容器设计。在所有情况下,ISO均以快速收敛和强大鲁棒性优于SO,分别实现了5.69%、34.61%、20.73%和7.8%的性能提升,突出了其在实际应用中的卓越功效。