Hybrid Slime Mold and Arithmetic Optimization Algorithm with Random Center Learning and Restart Mutation

被引:9
作者
Chen, Hongmin [1 ]
Wang, Zhuo [1 ]
Jia, Heming [1 ]
Zhou, Xindong [1 ]
Abualigah, Laith [2 ,3 ,4 ,5 ,6 ,7 ]
机构
[1] Sanming Univ, Dept Informat Engn, Sanming 365004, Peoples R China
[2] Al Al Bayt Univ, Prince Hussein Bin Abdullah Coll Informat Technol, Mafraq 25113, Jordan
[3] Lebanese Amer Univ, Dept Elect & Comp Engn, Byblos 135053, Lebanon
[4] Al Ahliyya Amman Univ, Hourani Ctr Appl Sci Res, Amman 19328, Jordan
[5] Middle East Univ, MEU Res Unit, Amman 11831, Jordan
[6] Appl Sci Private Univ, Appl Sci Res Ctr, Amman 11931, Jordan
[7] Univ Sains Malaysia, Sch Comp Sci, Gelugor 11800, Malaysia
关键词
slime mold algorithm; arithmetic optimization algorithm; random center solution strategy; restart strategy; mutation strategy; PARTICLE SWARM OPTIMIZATION; GLOBAL OPTIMIZATION; METAHEURISTIC ALGORITHM; WHALE OPTIMIZATION; SEARCH ALGORITHM; COLONY; HYBRIDIZATION; SIMULATION; STRATEGY;
D O I
10.3390/biomimetics8050396
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The slime mold algorithm (SMA) and the arithmetic optimization algorithm (AOA) are two novel meta-heuristic optimization algorithms. Among them, the slime mold algorithm has a strong global search ability. Still, the oscillation effect in the later iteration stage is weak, making it difficult to find the optimal position in complex functions. The arithmetic optimization algorithm utilizes multiplication and division operators for position updates, which have strong randomness and good convergence ability. For the above, this paper integrates the two algorithms and adds a random central solution strategy, a mutation strategy, and a restart strategy. A hybrid slime mold and arithmetic optimization algorithm with random center learning and restart mutation (RCLSMAOA) is proposed. The improved algorithm retains the position update formula of the slime mold algorithm in the global exploration section. It replaces the convergence stage of the slime mold algorithm with the multiplication and division algorithm in the local exploitation stage. At the same time, the stochastic center learning strategy is adopted to improve the global search efficiency and the diversity of the algorithm population. In addition, the restart strategy and mutation strategy are also used to improve the convergence accuracy of the algorithm and enhance the later optimization ability. In comparison experiments, different kinds of test functions are used to test the specific performance of the improvement algorithm. We determine the final performance of the algorithm by analyzing experimental data and convergence images, using the Wilcoxon rank sum test and Friedman test. The experimental results show that the improvement algorithm, which combines the slime mold algorithm and arithmetic optimization algorithm, is effective. Finally, the specific performance of the improvement algorithm on practical engineering problems was evaluated.
引用
收藏
页数:30
相关论文
共 67 条
  • [1] Reptile Search Algorithm (RSA): A nature-inspired meta-heuristic optimizer
    Abualigah, Laith
    Abd Elaziz, Mohamed
    Sumari, Putra
    Geem, Zong Woo
    Gandomi, Amir H.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2022, 191
  • [2] Aquila Optimizer: A novel meta-heuristic optimization algorithm
    Abualigah, Laith
    Yousri, Dalia
    Abd Elaziz, Mohamed
    Ewees, Ahmed A.
    Al-qaness, Mohammed A. A.
    Gandomi, Amir H.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 157 (157)
  • [3] The Arithmetic Optimization Algorithm
    Abualigah, Laith
    Diabat, Ali
    Mirjalili, Seyedali
    Elaziz, Mohamed Abd
    Gandomi, Amir H.
    [J]. COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2021, 376
  • [4] INFO: An efficient optimization algorithm based on weighted mean of vectors
    Ahmadianfar, Iman
    Heidari, Ali Asghar
    Noshadian, Saeed
    Chen, Huiling
    Gandomi, Amir H.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2022, 195
  • [5] RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method
    Ahmadianfar, Iman
    Heidari, Ali Asghar
    Gandomi, Amir H.
    Chu, Xuefeng
    Chen, Huiling
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2021, 181
  • [6] Arnold DV, 2002, IEEE T EVOLUT COMPUT, V6, P30, DOI [10.1109/4235.985690, 10.1023/A:1015059928466]
  • [7] Banzhaf W., 1997, GENETIC PROGRAMMING
  • [8] Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems - Part 2: Constrained optimization
    Baykasoglu, Adil
    Akpinar, Sener
    [J]. APPLIED SOFT COMPUTING, 2015, 37 : 396 - 415
  • [9] Adaptive firefly algorithm with chaos for mechanical design optimization problems
    Baykasoglu, Adil
    Ozsoydan, Fehmi Burcin
    [J]. APPLIED SOFT COMPUTING, 2015, 36 : 152 - 164
  • [10] An efficient genetic algorithm for multi-objective solid travelling salesman problem under fuzziness
    Changdar, Chiranjit
    Mahapatra, G. S.
    Pal, Rajat Kumar
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2014, 15 : 27 - 37