A Chaos Sparrow Search Algorithm with Logarithmic Spiral and Adaptive Step for Engineering Problems

被引:53
作者
Tang, Andi [1 ]
Zhou, Huan [1 ]
Han, Tong [1 ]
Xie, Lei [1 ]
机构
[1] Air Force Engn Univ, Aeronaut Engn Coll, Xian 710038, Peoples R China
来源
CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES | 2022年 / 130卷 / 01期
关键词
Sparrow search algorithm; global optimization; adaptive step; benchmark function; chaos map; DIFFERENTIAL EVOLUTION; OPTIMIZATION ALGORITHM; NEIGHBORHOOD SEARCH; SWARM OPTIMIZATION;
D O I
10.32604/cmes.2021.017310
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The sparrow search algorithm (SSA) is a newly proposed meta-heuristic optimization algorithm based on the sparrow foraging principle. Similar to other meta-heuristic algorithms, SSA has problems such as slow convergence speed and difficulty in jumping out of the local optimum. In order to overcome these shortcomings, a chaotic sparrow search algorithm based on logarithmic spiral strategy and adaptive step strategy (CLSSA) is proposed in this paper. Firstly, in order to balance the exploration and exploitation ability of the algorithm, chaotic mapping is introduced to adjust the main parameters of SSA. Secondly, in order to improve the diversity of the population and enhance the search of the surrounding space, the logarithmic spiral strategy is introduced to improve the sparrow search mechanism. Finally, the adaptive step strategy is introduced to better control the process of algorithm exploitation and exploration. The best chaotic map is determined by different test functions, and the CLSSA with the best chaotic map is applied to solve 23 benchmark functions and 3 classical engineering problems. The simulation results show that the iterative map is the best chaotic map, and CLSSA is efficient and useful for engineering problems, which is better than all comparison algorithms.
引用
收藏
页码:331 / 364
页数:34
相关论文
共 51 条
[1]  
Arnold DV, 2002, IEEE T EVOLUT COMPUT, V6, P30, DOI [10.1109/4235.985690, 10.1023/A:1015059928466]
[2]   An adaptive large neighborhood search heuristic for dynamic vehicle routing problems [J].
Chen, Shifeng ;
Chen, Rong ;
Wang, Gai-Ge ;
Gao, Jian ;
Sangaiah, Arun Kumar .
COMPUTERS & ELECTRICAL ENGINEERING, 2018, 67 :596-607
[3]  
COLORNI A, 1992, FROM ANIM ANIMAT, P134
[4]  
Deb K., 1996, Comput Sci Inf, V26, P30
[5]   A simulated annealing approach to define the genetic structure of populations [J].
Dupanloup, I ;
Schneider, S ;
Excoffier, L .
MOLECULAR ECOLOGY, 2002, 11 (12) :2571-2581
[6]  
Eberhart R., 1995, 6 INT S MICR HUM SCI, P39
[7]   Performance analysis of Chaotic Multi-Verse Harris Hawks Optimization: A case study on solving engineering problems [J].
Ewees, Ahmed A. ;
Abd Elaziz, Mohamed .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2020, 88
[8]   Monarch butterfly optimization: A comprehensive review [J].
Feng, Yanhong ;
Deb, Suash ;
Wang, Gai-Ge ;
Alavi, Amir H. .
EXPERT SYSTEMS WITH APPLICATIONS, 2021, 168
[9]   Solving Fuzzy Job-Shop Scheduling Problem Using DE Algorithm Improved by a Selection Mechanism [J].
Gao, Da ;
Wang, Gai-Ge ;
Pedrycz, Witold .
IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2020, 28 (12) :3265-3275
[10]  
Goldberg D., 1989, Genetic Algorithms in Search, Optimization, and Machine Learning