Growth Optimizer: A powerful metaheuristic algorithm for solving continuous and discrete global optimization problems

被引:61
|
作者
Zhang, Qingke [1 ]
Gao, Hao [1 ]
Zhan, Zhi-Hui [2 ]
Li, Junqing [1 ]
Zhang, Huaxiang [1 ]
机构
[1] Shandong Normal Univ, Sch Informat Sci & Engn, Jinan 250358, Peoples R China
[2] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510006, Peoples R China
关键词
Metaheuristic algorithms; Growth optimizer; Global optimization; Multiple sequence alignment; Image segmentation; INSPIRED ALGORITHM; SEARCH; EVOLUTION;
D O I
10.1016/j.knosys.2022.110206
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, a novel and powerful metaheuristic optimizer, named the growth optimizer (GO), is proposed. Its main design inspiration originates from the learning and reflection mechanisms of individuals in their growth processes in society. Learning is the process of individuals growing up by acquiring knowledge from the outside world. Reflection is the process of checking the individual's own deficiencies and adjusting the individual's learning strategies to help the individual's growth. This work simulates this growth behavior mathematically and benchmarks the proposed algorithm on a total of 30 international test functions of the 2017 IEEE Congress on Evolutionary Computation real-parameter boundary constraint benchmark (CEC 2017 test suite). A total of 50 state-of-the-art metaheuristic algorithms participated in the comparison process. The results of the convergence accuracy comparison and the two nonparametric statistics based on the Friedman test and the Wilcoxon signed-rank test showed that GO provides competitive results compared to the 50 state-ofthe-art metaheuristic algorithms tested. In addition, to verify that GO has the ability to solve different real-world optimization problems, GO was applied to two different types of real-world optimization problems: the multiple sequence alignment (MSA) problem based on the hidden Markov model (HMM) and the multithresholding image segmentation problem based on Kapur's entropy method. GO provided more promising results than other metaheuristic techniques, especially in terms of solution quality and avoidance of local optima. The source code of the GO algorithm is publicly available at https://github.com/tsingke/Growth-Optimizer.(c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:31
相关论文
共 50 条
  • [1] Search in forest optimizer: a bioinspired metaheuristic algorithm for global optimization problems
    Amin Ahwazian
    Atefeh Amindoust
    Reza Tavakkoli-Moghaddam
    Mehrdad Nikbakht
    [J]. Soft Computing, 2022, 26 : 2325 - 2356
  • [2] Search in forest optimizer: a bioinspired metaheuristic algorithm for global optimization problems
    Ahwazian, Amin
    Amindoust, Atefeh
    Tavakkoli-Moghaddam, Reza
    Nikbakht, Mehrdad
    [J]. SOFT COMPUTING, 2022, 26 (05) : 2325 - 2356
  • [3] The Expanded Invasive Weed Optimization Metaheuristic for Solving Continuous and Discrete Optimization Problems
    Josinski, Henryk
    Kostrzewa, Daniel
    Michalczuk, Agnieszka
    Switonski, Adam
    [J]. SCIENTIFIC WORLD JOURNAL, 2014,
  • [4] Secretary bird optimization algorithm: a new metaheuristic for solving global optimization problems
    Fu, Youfa
    Liu, Dan
    Chen, Jiadui
    He, Ling
    [J]. ARTIFICIAL INTELLIGENCE REVIEW, 2024, 57 (05)
  • [5] Farmland fertility: A new metaheuristic algorithm for solving continuous optimization problems
    Shayanfar, Human
    Gharehchopogh, Farhad Soleimanian
    [J]. APPLIED SOFT COMPUTING, 2018, 71 : 728 - 746
  • [6] Lemurs Optimizer: A New Metaheuristic Algorithm for Global Optimization
    Abasi, Ammar Kamal
    Makhadmeh, Sharif Naser
    Al-Betar, Mohammed Azmi
    Alomari, Osama Ahmad
    Awadallah, Mohammed A.
    Alyasseri, Zaid Abdi Alkareem
    Abu Doush, Iyad
    Elnagar, Ashraf
    Alkhammash, Eman H.
    Hadjouni, Myriam
    [J]. APPLIED SCIENCES-BASEL, 2022, 12 (19):
  • [7] Multidirectional Grey Wolf Optimizer Algorithm for Solving Global Optimization Problems
    Tawhid, Mohamed A.
    Ali, Ahmed F.
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS, 2018, 17 (04)
  • [8] Numeric Crunch Algorithm: a new metaheuristic algorithm for solving global and engineering optimization problems
    Thapliyal, Shivankur
    Kumar, Narender
    [J]. SOFT COMPUTING, 2023, 27 (22) : 16611 - 16657
  • [9] Group teaching optimization algorithm: A novel metaheuristic method for solving global optimization problems
    Zhang, Yiying
    Jin, Zhigang
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2020, 148
  • [10] Numeric Crunch Algorithm: a new metaheuristic algorithm for solving global and engineering optimization problems
    Shivankur Thapliyal
    Narender Kumar
    [J]. Soft Computing, 2023, 27 : 16611 - 16657