Effective hybridization of JAYA and teaching-learning-based optimization algorithms for numerical function optimization

被引:1
|
作者
Gholami, Jafar [1 ]
Nia, Fariba Abbasi [1 ]
Sanatifar, Maryam [1 ]
Zawbaa, Hossam M. [2 ,3 ]
机构
[1] Islamic Azad Univ, Dept Comp Engn, Kermanshah Sci & Res Branch, Kermanshah, Iran
[2] Beni Suef Univ, Fac Comp & Artificial Intelligence, Bani Suwayf, Egypt
[3] Appl Sci Private Univ, Appl Sci Res Ctr, Amman, Jordan
关键词
JAYA; Teaching-learning-based optimization; Hybridization of JAYA and teaching-learning-based optimization algorithms; Convergence; PARTICLE SWARM OPTIMIZATION; DIFFERENTIAL EVOLUTION; HYBRID; DESIGN;
D O I
10.1007/s00500-023-08201-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The JAYA is classified as the state-of-the-art population-oriented algorithm for the optimization of diverse problems, both discrete and continuous. The concept behind this algorithm is to present a solution by means of the best and worst individuals in the population. On the other hand, teaching-learning-based optimization algorithm cooperation of a teacher on students' learning process. Due to each one having some benefits and drawbacks, combining those leads to better exploring the problem. Consequently, this investigation exploits the hybridization of both mentioned algorithms, and a novel algorithm is made named H-JTLBO (hybridization of JAYA and teaching learning-based optimization). The proposed approach is then evaluated using different test functions used frequently in the literate. Finally, the results of such functions are compared with other optimization algorithms which have recently been introduced in the literature, such as Sine Cosine Algorithm (SCA), Grasshopper Optimization Algorithm (GOA), Moth-flame optimization (MFO), and JAYA algorithm. In addition, the statistical test is used to evaluate the proposed method. Through the results, H-JTLBO outperforms all mentioned algorithms in terms of convergence and solution quality.
引用
收藏
页码:9673 / 9691
页数:19
相关论文
共 50 条
  • [21] Teaching-learning-based optimization algorithm with dynamic neighborhood and crossover search mechanism for numerical optimization
    Zeng, Zhibo
    Dong, He
    Xu, Yunlang
    Zhang, Wei
    Yu, Hangcheng
    Li, Xiaoping
    APPLIED SOFT COMPUTING, 2024, 154
  • [22] Modified Teaching-Learning-Based Optimization algorithm for global numerical optimization-A comparative study
    Satapathy, Suresh Chandra
    Naik, Anima
    SWARM AND EVOLUTIONARY COMPUTATION, 2014, 16 : 28 - 37
  • [23] A note on teaching-learning-based optimization algorithm
    Crepinsek, Matej
    Liu, Shih-Hsi
    Mernik, Luka
    INFORMATION SCIENCES, 2012, 212 : 79 - 93
  • [24] Improved Teaching-Learning-Based Optimization Algorithm
    Zhai, Junchang
    Qin, Yuping
    Zhao, Zhen
    Yao, Minghai
    2018 37TH CHINESE CONTROL CONFERENCE (CCC), 2018, : 3112 - 3116
  • [25] Memetic Teaching-Learning-Based Optimization algorithms for large graph coloring problems
    Dokeroglu, Tansel
    Sevinc, Ender
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2021, 102
  • [26] A reformative teaching-learning-based optimization algorithm for solving numerical and engineering design optimization problems
    Li, Zhuang
    Zhang, Xiaotong
    Qin, Jingyan
    He, Jie
    SOFT COMPUTING, 2020, 24 (20) : 15889 - 15906
  • [27] CTLBO: Converged teaching-learning-based optimization
    Mahmoodabadi, M. J.
    Ostadzadeh, R.
    COGENT ENGINEERING, 2019, 6 (01):
  • [28] Modified Teaching-Learning-Based Optimization Algorithm
    Tuo ShouHeng
    2013 32ND CHINESE CONTROL CONFERENCE (CCC), 2013, : 7976 - 7981
  • [29] Teaching-learning-based pathfinder algorithm for function and engineering optimization problems
    Tang, Chengmei
    Zhou, Yongquan
    Tang, Zhonghua
    Luo, Qifang
    APPLIED INTELLIGENCE, 2021, 51 (07) : 5040 - 5066
  • [30] Teaching-learning-based pathfinder algorithm for function and engineering optimization problems
    Chengmei Tang
    Yongquan Zhou
    Zhonghua Tang
    Qifang Luo
    Applied Intelligence, 2021, 51 : 5040 - 5066