.png){kind=icon}
Return
Adaptive Auxiliary Task Selection for Multitasking-Assisted Constrained Multi-Objective Optimization [Feature]
.png){kind=icon}
PRE
AI
DOI：10.1109/MCI.2023.3245719.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Solving constrained multi-objective optimization problems (CMOPs) is one of the most popular research topics in the multi-objective optimization community. Various approaches based on different algorithmic strategies have been proposed for benchmark CMOPs with different features and challenges. Although most of these algorithms employ one or more fixed strategies, determining the most suitable strategy is challenging and problem-dependent. This work presents a general multitasking framework comprising a main task for the original CMOP and an arbitrary number of auxiliary tasks based on different strategies for the auxiliary problems. Reinforcement learning techniques are utilized according to the population state to choose the most suitable auxiliary task during the evolutionary process. As instantiations, Q-Learning and Deep Q-Learning are successfully applied in the framework. Accordingly, two novel algorithms are developed to solve CMOPs. The results demonstrate the effectiveness of the proposed approaches on five benchmark CMOP test suites and real-world problems compared to 11 advanced methods.
Keywords:
Q-learning
Sociology
Benchmark testing
Multitasking
Task analysis
Statistics
Optimization
Journal
IF:
11.2
Papers:
606
Citations:
3.1K
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveMultiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
PREAI
ShareSaveShareSave
View more