<p>In this study, an improved snake optimizer (ISO) enhances snake optimizer (SO) by introducing novel mechanisms for improving convergence ability and stability. Based on the “No Free Lunch” theory, this paper discusses the development status of swarm intelligence algorithms. ISO introducing a chaotic mapping strategy allows the population to generate uniform and randomly distributed initial values at the beginning of ISO. A forced switching mechanism improving the balance between two different updating phases is introduced to address the slow convergence rate based on SO. A variant strategy of whale optimization algorithm is used to make further improvement for exploration of SO. The optimal domain perturbation strategy is used to find a better value near the result after above process. These enhancements result a more robust and effective optimization framework suiting to solve complex continuous optimization problems across various domains. The convergence ability and stability are validated by comparing ISO with SO and eight other classical or latest algorithms with dimensionality setting as Dim = 10 and Dim = 20 in the test functions from CEC-2021. The convergence efficiency achieves 94/160 and the convergence stability achieves 77/160. The ratio of convergence efficiency achieves <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10404_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="39" /> </InlineMediaObject> <EquationSource Format="TEX">\(100\%\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>100</mn> <mo>%</mo> </mrow> </math></EquationSource> </InlineEquation> and the ratio of convergence stability achieves <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10404_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="51" /> </InlineMediaObject> <EquationSource Format="TEX">\(96.25\%\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>96.25</mn> <mo>%</mo> </mrow> </math></EquationSource> </InlineEquation> in the applicable functions which are half of CEC-2021 functions. They represent the problems which ISO performs well. The practicality of ISO is further illustrated using three continuous optimization problems. Based on the simulation results, the discretization of ISO is prospected to solve combinatorial optimization problems.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Improved snake optimizer based on forced switching mechanism and variable spiral search for practical applications problems

  • Yanfeng Wang,
  • Bingqing Xin,
  • Zicheng Wang,
  • Junwei Sun

摘要

In this study, an improved snake optimizer (ISO) enhances snake optimizer (SO) by introducing novel mechanisms for improving convergence ability and stability. Based on the “No Free Lunch” theory, this paper discusses the development status of swarm intelligence algorithms. ISO introducing a chaotic mapping strategy allows the population to generate uniform and randomly distributed initial values at the beginning of ISO. A forced switching mechanism improving the balance between two different updating phases is introduced to address the slow convergence rate based on SO. A variant strategy of whale optimization algorithm is used to make further improvement for exploration of SO. The optimal domain perturbation strategy is used to find a better value near the result after above process. These enhancements result a more robust and effective optimization framework suiting to solve complex continuous optimization problems across various domains. The convergence ability and stability are validated by comparing ISO with SO and eight other classical or latest algorithms with dimensionality setting as Dim = 10 and Dim = 20 in the test functions from CEC-2021. The convergence efficiency achieves 94/160 and the convergence stability achieves 77/160. The ratio of convergence efficiency achieves \(100\%\) 100 % and the ratio of convergence stability achieves \(96.25\%\) 96.25 % in the applicable functions which are half of CEC-2021 functions. They represent the problems which ISO performs well. The practicality of ISO is further illustrated using three continuous optimization problems. Based on the simulation results, the discretization of ISO is prospected to solve combinatorial optimization problems.