Back to Search
Start Over
基于切线飞行的麻雀搜索算法.
- Source :
-
Application Research of Computers / Jisuanji Yingyong Yanjiu . Jan2023, Vol. 40 Issue 1, p141-146. 6p. - Publication Year :
- 2023
-
Abstract
- In order to solve the problem that the original sparrow search algorithm (Sparrow Search Algorithm, SSA) has reduced population diversity and the weak local development ability makes it difficult to jump out of the local optimum under the condition of approaching the global optimum. This paper proposes a sparrow search algorithm based on tangential flight (tangent flight Sparrow Search Algorithm, tanSSA). First of all, using adaptive t-distribution strategy to improve the finder location update formula can improve the individual sparrow’s optimization ability and prevent the algorithm from maturing. Then, the tangent flight strategy in the tangent search algorithm can enhance the search space ability of the algorithm, and can make the algorithm jump out of the advantage of the local optimal solution. In original sparrow search algorithm, using the tangent flight disturbance strategy to disturb the optimal solution. The combination of these two strategies can effectively improve the exploration and development performance of tanSSA algorithm. Finally, using 12 standard benchmark functions to test and verify the optimization performance of tanSSA algorithm combined with Wilcoxon rank sum test, and compared with the original SSA algorithm, whale optimization algorithm, particle swarm optimization algorithm and adaptive t-distribution SSA algorithm. The experimental results show that the optimization ability and convergence speed of the sparrow search algorithm based on tangent flight have a significant improvement. [ABSTRACT FROM AUTHOR]
Details
- Language :
- Chinese
- ISSN :
- 10013695
- Volume :
- 40
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Application Research of Computers / Jisuanji Yingyong Yanjiu
- Publication Type :
- Academic Journal
- Accession number :
- 161285611
- Full Text :
- https://doi.org/10.19734/j.issn.1001-3695.2022.06.0299