Modified Sand Cat Swarm Optimization Algorithm for Solving Constrained Engineering Optimization Problems

被引:81
作者
Wu, Di [1 ]
Rao, Honghua [2 ]
Wen, Changsheng [2 ]
Jia, Heming [2 ]
Liu, Qingxin [3 ]
Abualigah, Laith [4 ,5 ,6 ,7 ]
机构
[1] Sanming Univ, Sch Educ & Mus, Sanming 365004, Peoples R China
[2] Sanming Univ, Sch Informat Engn, Sanming 365004, Peoples R China
[3] Hainan Univ, Sch Comp Sci & Technol, Haikou 570228, Hainan, Peoples R China
[4] Al Ahliyya Amman Univ, Hourani Ctr Appl Sci Res, Amman 19328, Jordan
[5] Middle East Univ, Fac Informat Technol, Amman 11831, Jordan
[6] Appl Sci Private Univ, Fac Informat Technol, Amman 11931, Jordan
[7] Univ Sains Malaysia, Sch Comp Sci, George Town 11800, Malaysia
关键词
sand cat swarm optimization algorithm; sound frequency; exploitation ability; wandering strategy; exploration ability; lens opposition-based learning strategy; engineering problem; HEURISTIC OPTIMIZATION; VARIANTS; HYBRIDS;
D O I
10.3390/math10224350
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The sand cat swarm optimization algorithm (SCSO) is a recently proposed metaheuristic optimization algorithm. It stimulates the hunting behavior of the sand cat, which attacks or searches for prey according to the sound frequency; each sand cat aims to catch better prey. Therefore, the sand cat will search for a better location to catch better prey. In the SCSO algorithm, each sand cat will gradually approach its prey, which makes the algorithm a strong exploitation ability. However, in the later stage of the SCSO algorithm, each sand cat is prone to fall into the local optimum, making it unable to find a better position. In order to improve the mobility of the sand cat and the exploration ability of the algorithm. In this paper, a modified sand cat swarm optimization (MSCSO) algorithm is proposed. The MSCSO algorithm adds a wandering strategy. When attacking or searching for prey, the sand cat will walk to find a better position. The MSCSO algorithm with a wandering strategy enhances the mobility of the sand cat and makes the algorithm have stronger global exploration ability. After that, the lens opposition-based learning strategy is added to enhance the global property of the algorithm so that the algorithm can converge faster. To evaluate the optimization effect of the MSCSO algorithm, we used 23 standard benchmark functions and CEC2014 benchmark functions to evaluate the optimization performance of the MSCSO algorithm. In the experiment, we analyzed the data statistics, convergence curve, Wilcoxon rank sum test, and box graph. Experiments show that the MSCSO algorithm with a walking strategy and a lens position-based learning strategy had a stronger exploration ability. Finally, the MSCSO algorithm was used to test seven engineering problems, which also verified the engineering practicability of the proposed algorithm.
引用
收藏
页数:41
相关论文
共 50 条
  • [1] A Modified Group Teaching Optimization Algorithm for Solving Constrained Engineering Optimization Problems
    Rao, Honghua
    Jia, Heming
    Wu, Di
    Wen, Changsheng
    Li, Shanglong
    Liu, Qingxin
    Abualigah, Laith
    MATHEMATICS, 2022, 10 (20)
  • [2] Enhanced Remora Optimization Algorithm for Solving Constrained Engineering Optimization Problems
    Wang, Shuang
    Hussien, Abdelazim G.
    Jia, Heming
    Abualigah, Laith
    Zheng, Rong
    MATHEMATICS, 2022, 10 (10)
  • [3] Improve coati optimization algorithm for solving constrained engineering optimization problems
    Jia, Heming
    Shi, Shengzhao
    Wu, Di
    Rao, Honghua
    Zhang, Jinrui
    Abualigah, Laith
    JOURNAL OF COMPUTATIONAL DESIGN AND ENGINEERING, 2023, 10 (06) : 2223 - 2250
  • [4] Modified prairie dog optimization algorithm for global optimization and constrained engineering problems
    Yu, Huangjing
    Wang, Yuhao
    Jia, Heming
    Abualigah, Laith
    MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2023, 20 (11) : 19086 - 19132
  • [5] Enhanced Aquila optimizer algorithm for global optimization and constrained engineering problems
    Yu, Huangjing
    Jia, Heming
    Zhou, Jianping
    Hussien, Abdelazim G.
    MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2022, 19 (12) : 14173 - 14211
  • [6] Improved sandcat swarm optimization algorithm for solving global optimum problems
    Jia, Heming
    Zhang, Jinrui
    Rao, Honghua
    Abualigah, Laith
    ARTIFICIAL INTELLIGENCE REVIEW, 2024, 58 (01)
  • [7] Gannet optimization algorithm : A new metaheuristic algorithm for solving engineering optimization problems
    Pan, Jeng-Shyang
    Zhang, Li-Gang
    Wang, Ruo-Bin
    Snasel, Vaclav
    Chu, Shu-Chuan
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2022, 202 : 343 - 373
  • [8] Multi-objective sand cat swarm optimization based on adaptive clustering for solving multimodal multi-objective optimization problems
    Niu, Yanbiao
    Yan, Xuefeng
    Zeng, Weiping
    Wang, Yongzhen
    Niu, Yanzhao
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2025, 227 : 391 - 404
  • [9] Program Source-Code Re-Modularization Using a Discretized and Modified Sand Cat Swarm Optimization Algorithm
    Arasteh, Bahman
    Seyyedabbasi, Amir
    Rasheed, Jawad
    Abu-Mahfouz, Adnan M.
    SYMMETRY-BASEL, 2023, 15 (02):
  • [10] An efficient hybrid algorithm based on Water Cycle and Moth-Flame Optimization algorithms for solving numerical and constrained engineering optimization problems
    Khalilpourazari, Soheyl
    Khalilpourazary, Saman
    SOFT COMPUTING, 2019, 23 (05) : 1699 - 1722