The basic sand cat swarm optimization (SCSO) algorithm has the shortcomings of low accuracy, slow convergence and easy local optimality in solving complex optimization problems. An improved SCSO algorithm (Improved sand cat swarm optimization, ISCSO) is proposed based on chaotic sequences and Lévy flight. The initial population is generated using the Kent chaos strategy, which reduces the overlapping probability of individual distribution within the sand cat population and increases the diversity of the initial sand cat population. The auditory sensitivity of the sand cat is improved to balance the process of sand cat development and exploration, increasing the search range of the algorithm while improving the convergence speed. The introduction of Lévy flight trajectory change perturbs the sand cat position, updates the position formula, improves the situation of the sand cat falling into local stagnation, and improves the algorithm in the iterative process of premature and falling into the local optimum. Through the test of the benchmark function, comparing the optimal value, the mean value, the standard deviation and the Wilcoxon rank sum test under different optimization algorithms, the statistical results that the improved SCSO algorithm has higher accuracy in finding the best and better convergence. Finally, ISCSO is used to optimize the welded beam problem to further verify the effectiveness of the improved algorithm.
Published in | Science Discovery (Volume 10, Issue 6) |
DOI | 10.11648/j.sd.20221006.26 |
Page(s) | 482-488 |
Creative Commons |
This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited. |
Copyright |
Copyright © The Author(s), 2022. Published by Science Publishing Group |
Sand Cat Swarm Optimization, Kent Chaotic, Lévy Flight, Multi-strategy Cooperative, Parameter Optimization
[1] | 任洁, 彭建文. 求解多目标优化问题的邻近牛顿法 [J]. 应用数学学报, 2022, 45 (02): 222-237. |
[2] | 秦廷华. 解最优控制问题结合同伦法的自适应拟谱方法 [J]. 自动化学报, 2019, 45 (08): 1579-1585. |
[3] | 魏锋. 机构分析与综合中若干问题及其几何代数方法研究 [D]. 北京: 北京邮电大学, 2017. |
[4] | Jamil M, Yang XS. A Literature Survey of Benchmark Functions For Global Optimization Problems [J]. Mathematics, 2013, https://doi.org/10.1504/IJMMNO.2013.055204. |
[5] | Zhai Longzhen, Feng Shaohong. A novel evacuation path planning method based on improved genetic algorithm [J]. Journal of Intelligent & Fuzzy Systems, 2022, 42 (3): 1813-1823. |
[6] | Yuan Shijin, Xu Yunjia, Mu Bin, et al. An Improved Continuous Tabu Search Algorithm with Adaptive Neighborhood Radius and Increasing Search Iteration Times Strategies [J]. International Journal on Artificial Intelligence Tools, 2021, 30 (2): Article ID 2150001. |
[7] | Daneshyar SA, Charkari NM. Biogeography based optimization method for robust visual object tracking Biogeography based optimization method for robust visual object tracking [J]. Applied Soft Computing, 2022, 122: Article ID 108802. |
[8] | Hayyolalam V, Kazem AAP. Black Widow Optimization Algorithm: A novel meta-heuristic approach for solving engineering optimization problems [J]. Engineering Applications of Artificial Intelligence, 2020, 87: Article ID 103249. |
[9] | Joshi SK. Chaos embedded opposition based learning for gravitational search algorithm [J]. Applied Intelligence, 2022. https://doi.org/10.1007/s10489-022-03786-9. |
[10] | Pashaei E, Pashaei E. A fusion approach based on black hole algorithm and particle swarm optimization for image enhancement [J/OL]. Multimedia Tools and Applications, 2022. https://doi.org/10.1007/s11042-022-13275-3 |
[11] | Olavo HM, Chris TB. Solving the patient zero inverse problem by using generalized simulated annealing [J]. Physica A: Statistical Mechanics and its Applications, 2018, 490: 1513-1521. |
[12] | Bisen M, Saha SK, Kar R. MVO Based Optimal Design of Stable IIR HPF and Its FPGA Implementation [C] // 2021 3rd International Conference on Signal Processing and Communication. Coimbatore: IEEE Press, 2021: 202-206. |
[13] | Yang X, Li HR, Yu X. A dynamic multi-swarm cooperation particle swarm optimization with dimension mutation for complex optimization problem [J]. International Journal of Machine Learning and Cybernetics, 2022, 13 (9): 2581-2608. |
[14] | Ho SL, Yang SY, Wong HC, et al. An improved ant colony optimization algorithm and its application to electromagnetic devices designs [J]. IEEE Trans on Magnetics, 2022, 41 (5): 1764-1767. |
[15] | Hemasian-Etefagh F, Safi-Esfahani F. Group-based whale optimization algorithm [J]. Soft Computing, 2020, 24 (5): 3647-3673. |
[16] | Wu CY, Fu XS, Pei JK, et al. A Novel Sparrow Search Algorithm for the Traveling Salesman Problem [J]. IEEE Access, 2021, 153456-153471, https://doi.org/10.1109/ACCESS.2021.3128433. |
[17] | 王勇亮, 王挺, 姚辰. 基于Kent映射和自适应权重的灰狼优化算法 [J]. 计算机应用研究, 2020, 37 (S2): 37-40. |
[18] | Seyyedabbasi A, Kiani F. Sand Cat swarm optimization: a nature-inspired algorithm to solve global optimization problems [J]. Engineering with Computers, 2022, https://doi.org/10.1007/s00366-022-01604-x. |
[19] | 毛清华, 王迎港. 融合改进Logistics混沌和正弦余弦算子的自适应t分布海鸥算法 [J/OL]. 小型微型计算机系统. (2021-10-22) [2022-09-12]. |
[20] | 付华, 刘昊. 多策略融合的改进麻雀搜索算法及其应用 [J]. 控制与决策, 2022, 37 (01): 87-96. |
[21] | 刘小龙. 改进多元宇宙算法求解大规模实值优化问题 [J]. 电子与信息学报, 2019, 41 (07): 1666-1673. |
[22] | 龙文, 徐明, 羊洋. 用于函数优化和特征选择的翻筋斗觅食海鸥优化算法 [J/OL]. 计算机应用研究. (2022-07-28) [2022-09-11]. |
[23] | 王智慧, 代永强, 刘欢 基于自适应飞蛾扑火优化算法的三维路径规划 [J/OL]. 计算机应用研究. (2022-08-30) [2022-09-11]. |
[24] | 刘建军, 石定元, 武国宁. 基于Kent映射的混合混沌优化算法 [J]. 计算机工程与设计, 2015, 36 (06): 1497-1503. |
[25] | Coello C A. C. Use of a self-adaptive penalty approach for engineering optimization problems [J]. Computers in Industry, 2000, 41 (2): 113-127. |
APA Style
Qiao He, Zhang Yuhan. (2022). Improved Sand Cat Swarm Optimization with Multi-strategy Cooperative. Science Discovery, 10(6), 482-488. https://doi.org/10.11648/j.sd.20221006.26
ACS Style
Qiao He; Zhang Yuhan. Improved Sand Cat Swarm Optimization with Multi-strategy Cooperative. Sci. Discov. 2022, 10(6), 482-488. doi: 10.11648/j.sd.20221006.26
@article{10.11648/j.sd.20221006.26, author = {Qiao He and Zhang Yuhan}, title = {Improved Sand Cat Swarm Optimization with Multi-strategy Cooperative}, journal = {Science Discovery}, volume = {10}, number = {6}, pages = {482-488}, doi = {10.11648/j.sd.20221006.26}, url = {https://doi.org/10.11648/j.sd.20221006.26}, eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.sd.20221006.26}, abstract = {The basic sand cat swarm optimization (SCSO) algorithm has the shortcomings of low accuracy, slow convergence and easy local optimality in solving complex optimization problems. An improved SCSO algorithm (Improved sand cat swarm optimization, ISCSO) is proposed based on chaotic sequences and Lévy flight. The initial population is generated using the Kent chaos strategy, which reduces the overlapping probability of individual distribution within the sand cat population and increases the diversity of the initial sand cat population. The auditory sensitivity of the sand cat is improved to balance the process of sand cat development and exploration, increasing the search range of the algorithm while improving the convergence speed. The introduction of Lévy flight trajectory change perturbs the sand cat position, updates the position formula, improves the situation of the sand cat falling into local stagnation, and improves the algorithm in the iterative process of premature and falling into the local optimum. Through the test of the benchmark function, comparing the optimal value, the mean value, the standard deviation and the Wilcoxon rank sum test under different optimization algorithms, the statistical results that the improved SCSO algorithm has higher accuracy in finding the best and better convergence. Finally, ISCSO is used to optimize the welded beam problem to further verify the effectiveness of the improved algorithm.}, year = {2022} }
TY - JOUR T1 - Improved Sand Cat Swarm Optimization with Multi-strategy Cooperative AU - Qiao He AU - Zhang Yuhan Y1 - 2022/12/08 PY - 2022 N1 - https://doi.org/10.11648/j.sd.20221006.26 DO - 10.11648/j.sd.20221006.26 T2 - Science Discovery JF - Science Discovery JO - Science Discovery SP - 482 EP - 488 PB - Science Publishing Group SN - 2331-0650 UR - https://doi.org/10.11648/j.sd.20221006.26 AB - The basic sand cat swarm optimization (SCSO) algorithm has the shortcomings of low accuracy, slow convergence and easy local optimality in solving complex optimization problems. An improved SCSO algorithm (Improved sand cat swarm optimization, ISCSO) is proposed based on chaotic sequences and Lévy flight. The initial population is generated using the Kent chaos strategy, which reduces the overlapping probability of individual distribution within the sand cat population and increases the diversity of the initial sand cat population. The auditory sensitivity of the sand cat is improved to balance the process of sand cat development and exploration, increasing the search range of the algorithm while improving the convergence speed. The introduction of Lévy flight trajectory change perturbs the sand cat position, updates the position formula, improves the situation of the sand cat falling into local stagnation, and improves the algorithm in the iterative process of premature and falling into the local optimum. Through the test of the benchmark function, comparing the optimal value, the mean value, the standard deviation and the Wilcoxon rank sum test under different optimization algorithms, the statistical results that the improved SCSO algorithm has higher accuracy in finding the best and better convergence. Finally, ISCSO is used to optimize the welded beam problem to further verify the effectiveness of the improved algorithm. VL - 10 IS - 6 ER -