1.Institute of Intelligent Network System, Henan University;2.College of Software, Henan University;3.Henan International Joint Laboratory of Theories and Key Technologies on Intelligence Networks, Henan University, Kaifeng, China
Special R&D and promotion programs in Henan; Graduate Education Innovation and Quality Improvement Project of Henan University (Grant No. SYL18060145 and SYL18020105)
In order to further improve the shortcomings that basic salp swarm algorithm is easy to fall into the local optimum, the optimization accuracy is sometimes not high, and the solution results are not stable, a global search-oriented adaptive leader salp swarm algorithm is proposed. The location of the last generation salp swarm group was introduced into the leader position update formula, which enhanced the sufficiency of global search and effectively avoided the algorithm falling into local extremum.Then add the inertia weight to the leader position update formula, and introduce the leader-follower adaptive adjustment strategy in the choice of global and local search, so that the algorithm has a large number of leaders in the early iteration and is greatly influenced by the global optimal solution, it can quickly converge to the global optimal region with a larger global search step; At the end of the iteration, the leader"s stride is small and the number of followers is large, so the algorithm can be mined deeply near the optimal solution to improve the convergence accuracy. Then the algorithm flow is given and the time complexity is analyzed theoretically. Finally, through the simulation experiment of function optimization of 5 representative comparison algorithms on multiple dimensions of 10 different feature benchmark functions, the test results show that the optimization accuracy and stability of the improved algorithm are significantly improved.