.png){kind=icon}
Return
Multitask Genetic Programming-Based Generative Hyperheuristics: A Case Study in Dynamic Scheduling
.png){kind=icon}
OA
AI
DOI：10.1109/TCYB.2021.3065340.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Evolutionary multitask learning has achieved great success due to its ability to handle multiple tasks simultaneously. However, it is rarely used in the hyperheuristic domain, which aims at generating a heuristic for a class of problems rather than solving one specific problem. The existing multitask hyperheuristic studies only focus on heuristic selection, which is not applicable to heuristic generation. To fill the gap, we propose a novel multitask generative hyperheuristic approach based on genetic programming (GP) in this article. Specifically, we introduce the idea in evolutionary multitask learning to GP hyperheuristics with a suitable evolutionary framework and individual selection pressure. In addition, an origin-based offspring reservation strategy is developed to maintain the quality of individuals for each task. To verify the effectiveness of the proposed approach, comprehensive empirical studies have been conducted on the homogeneous and heterogeneous multitask dynamic flexible job shop scheduling. The results show that the proposed algorithm can significantly improve the quality of scheduling heuristics for each task in all the examined scenarios. In addition, the evolved scheduling heuristics verify the mutual help among the tasks in a multitask scenario.
Keywords:
Task analysis
Statistics
Sociology
Dynamic scheduling
Job shop scheduling
Heuristic algorithms
Genetic programming
Dynamic scheduling
genetic programming (GP)
hyperheuristic
job shop scheduling
multitask learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave View more