Improved teaching-learning-based optimization algorithm with Cauchy mutation and chaotic operators

被引:8
作者
Bao, Yin-Yin [1 ]
Xing, Cheng [1 ]
Wang, Jie-Sheng [1 ]
Zhao, Xiao-Rui [1 ]
Zhang, Xing-Yue [1 ]
Zheng, Yue [1 ]
机构
[1] Univ Sci & Technol Liaoning, Sch Elect & Informat Engn, Anshan, Liaoning, Peoples R China
关键词
TLBO algorithm; Function optimization; Cauchy mutation; Chaos mapping; Engineering optimization;
D O I
10.1007/s10489-023-04705-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Teaching-Learning-Based Optimization (TLBO) is a population-based intelligent optimization algorithm, which simulates the "teaching" process of teachers to students and the "learning" process of students in the class. In order to solve the problems of slow optimization speed, low optimization accuracy and easy to fall into local optimization, an improved TLBO algorithm based on Cauchy mutation and chaos operators are proposed. Firstly, the dynamic selection of teachers in the "teaching" stage leads to higher class average grades. Learning from the best students in the class during the "learning" phase makes class results more focused. Secondly, after a teaching is completed, Cauchy mutation is carried out to make the algorithm population more diverse so as to get rid of the local optimal solution. Finally, on the basis of Cauchy mutation, chaos theory is introduced into the optimization process of TLBO algorithm, and 10 chaos are embedded in the process of generating random numbers by Cauchy mutation, which enhances its ergo city and irreconcilability to further improve its convergence speed and accuracy. The performance of the proposed improved TLBO algorithm was tested by using 30 benchmark functions in CEC-BC-2017, and finally two engineering design problems (cantilever arm design and pressure vessel design) were optimized. The experimental results show that the proposed TLBO algorithm has significantly improved its convergence speed and optimization accuracy.
引用
收藏
页码:21362 / 21389
页数:28
相关论文
共 46 条
[1]  
Abadi Martin, 2016, Proceedings of OSDI '16: 12th USENIX Symposium on Operating Systems Design and Implementation. OSDI '16, P265
[2]   The Arithmetic Optimization Algorithm [J].
Abualigah, Laith ;
Diabat, Ali ;
Mirjalili, Seyedali ;
Elaziz, Mohamed Abd ;
Gandomi, Amir H. .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2021, 376
[3]   Advances in Sine Cosine Algorithm: A comprehensive survey [J].
Abualigah, Laith ;
Diabat, Ali .
ARTIFICIAL INTELLIGENCE REVIEW, 2021, 54 (04) :2567-2608
[4]   Butterfly optimization algorithm: a novel approach for global optimization [J].
Arora, Sankalap ;
Singh, Satvir .
SOFT COMPUTING, 2019, 23 (03) :715-734
[5]   An improved butterfly optimization algorithm with chaos [J].
Arora, Sankalap ;
Singh, Satvir .
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2017, 32 (01) :1079-1088
[6]   Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition [J].
Atashpaz-Gargari, Esmaeil ;
Lucas, Caro .
2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, :4661-4667
[7]  
Bastanlar Y, 2014, METHODS MOL BIOL, V1107, P105, DOI 10.1007/978-1-62703-748-8_7
[8]   Teaching-learning-based optimization with variable-population scheme and its application for ANN and global optimization [J].
Chen, Debao ;
Lu, Renquan ;
Zou, Feng ;
Li, Suwen .
NEUROCOMPUTING, 2016, 173 :1096-1111
[9]   CHAOTIC SIMULATED ANNEALING BY A NEURAL-NETWORK MODEL WITH TRANSIENT CHAOS [J].
CHEN, LN ;
AIHARA, K .
NEURAL NETWORKS, 1995, 8 (06) :915-930
[10]   Spotted Hyena Optimizer for Solving Engineering Design Problems [J].
Dhiman, Gaurav ;
Kaur, Amandeep .
2017 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND DATA SCIENCE (MLDS 2017), 2017, :114-119