Abstract: In order to improve the problems of low convergence accuracy, slow speed and easy to fall into local minimum when the basic sparrow search algorithm deals with optimization problems, this paper proposes a simplex-guided sparrow search algorithm with improved search mechanism. Firstly, to solve the problem that the randomness of the finder search process is too high, the finder search mechanism is improved to improve the convergence speed and accuracy of the algorithm. Secondly, the sparrow search algorithm's reconnaissance mechanism is improved to improve the ability of the algorithm to jump out of the local minimum. Finally, the related operation of the simplex method is used for some individuals with poor fitness in each iteration to improve the searching ability of the algorithm. Performance comparison on eight benchmark test functions and some CEC2014 test functions and Wilcoxon rank sum test analysis verify the robustness of the improved algorithm.

Key words: sparrow search algorithm, discoverer, surveillance mechanism, simplex method