Chaotic map enabled algorithm hybridizing Hunger Games Search algorithm with Aquila Optimizer
Conference: ICMLCA 2021 - 2nd International Conference on Machine Learning and Computer Application
12/17/2021 - 12/19/2021 at Shenyang, China
Proceedings: ICMLCA 2021
Pages: 5Language: englishTyp: PDF
Personal VDE Members are entitled to a 10% discount on this title
Authors:
Zhang, Yujun; Zhao, Juan (School of Electronics and Information Engineering, Jingchu University of Technology, Jing men, China)
Yan, Yuxin (Academy of Arts, Jingchu University of Technology, Jing men, China)
Gao, Zhengming (School of Computer Engineering, Jingchu University of Technology & Institute of Intelligent Information Technology, Jingmen Industrial Technology Research Institute, Jing men, China)
Abstract:
In the improvement of the algorithm, the performance of the algorithm is usually improved by introducing mapping, mixing other algorithms, etc. Due to the characteristics of chaotic mapping, the randomness of the algorithm can be improved, and the hybrid algorithm can combine the advantages of two or more algorithms to improve the performance of the algorithm. In this paper, the multiplicative mapping is introduced. It first improves the performance of the algorithm, and then mixes the multiplicative map enabled Hunger Games Search (HGS) algorithm with the Aquila Optimizer (AO) algorithm, and it is called CHGSAO in this paper. Because the search performance of the HGS algorithm is weak, but the AO search performance is strong, the advantages of the AO algorithm are used to make up the defects of the multiplicative map enabled HGS algorithm. The results show that this improvement is effective and can significantly improve the performance of the algorithm.