A selection hyper-heuristic algorithm with Q-learning mechanism

被引:14
作者
Zhao, Fuqing [1 ]
Liu, Yuebao [1 ]
Zhu, Ningning [1 ]
Xu, Tianpeng [1 ]
Jonrinaldi [2 ]
机构
[1] Lanzhou Univ Technol, Sch Comp & Commun, Lanzhou 730050, Peoples R China
[2] Univ Andalas, Dept Ind Engn, Padang 25163, Indonesia
关键词
Hyper-heuristics; Q-learning; Reinforcement learning; Continuous optimization; INTELLIGENCE META-HEURISTICS; CONTINUOUS OPTIMIZATION; DESIGN;
D O I
10.1016/j.asoc.2023.110815
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The selection of an algorithm in the real world of the application domain is a challenging problem as no specific algorithm exists capable of solving all issues to a satisfactory requirement. Selecting a suitable algorithm presents major challenges such as solving problems requiring expert knowledge or trial-and-error algorithms, which have hindered advancements in this field. In this work, we introduce a novel method that uniquely addresses these challenges by integrating hyper-heuristic and Q-learning mechanism techniques. A selection hyper-heuristic algorithm with Q-learning (QLSHH) is proposed to select appropriate low-level heuristic (LLH) for the computation stages of the optimization process. The Q-learning mechanism guided by the feedback of the solution state was designed according to the environment. Four low-level heuristics (LLHs) were proposed according to the optimization mechanism for continuous optimization problems. The QLSHH learns the successful experience in the optimization process through Q-learning to select the appropriate LLH at each decision point. The results tested on the CEC 2017 and CEC 2020 benchmark suite show that the QLSHH outperforms the other nine comparison algorithms on 50% of the functions and the experimental results of algorithm complexity show that the proposed algorithm is the fastest compared with other algorithms.(c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:18
相关论文
共 72 条
[1]   A fault-tolerant adaptive genetic algorithm for service scheduling in internet of vehicles [J].
Abbasi, Shirin ;
Rahmani, Amir Masoud ;
Balador, Ali ;
Sahafi, Amir .
APPLIED SOFT COMPUTING, 2023, 143
[2]  
Asta S, 2013, LECT NOTES COMPUT SC, V7832, P169, DOI 10.1007/978-3-642-37198-1_15
[3]   Population size reduction for the differential evolution algorithm [J].
Brest, Janez ;
Maucec, Mirjam Sepesy .
APPLIED INTELLIGENCE, 2008, 29 (03) :228-247
[4]  
Brest J, 2017, IEEE C EVOL COMPUTAT, P1311, DOI 10.1109/CEC.2017.7969456
[5]  
Burke E.K., 2019, Handbook of Metaheuristics, VVolume 272, P453, DOI [DOI 10.1007/978-3-319-91086-4_14/COVER, DOI 10.1007/978-3-319-91086-4_14]
[6]   Hyper-heuristics: a survey of the state of the art [J].
Burke, Edmund K. ;
Gendreau, Michel ;
Hyde, Matthew ;
Kendall, Graham ;
Ochoa, Gabriela ;
Oezcan, Ender ;
Qu, Rong .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2013, 64 (12) :1695-1724
[7]   A reinforcement learning hyper-heuristic in multi-objective optimization with application to structural damage identification [J].
Cao, Pei ;
Zhang, Yang ;
Zhou, Kai ;
Tang, J. .
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2023, 66 (01)
[8]   Cooperative Double-Layer Genetic Programming Hyper-Heuristic for Online Container Terminal Truck Dispatching [J].
Chen, Xinan ;
Bai, Ruibin ;
Qu, Rong ;
Dong, Haibo .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2023, 27 (05) :1220-1234
[9]   Automatic design of hyper-heuristic based on reinforcement learning [J].
Choong, Shin Siang ;
Wong, Li-Pei ;
Lim, Chee Peng .
INFORMATION SCIENCES, 2018, 436 :89-107
[10]  
Cowling P, 2001, LECT NOTES COMPUT SC, V2079, P176