Journal
INFORMATION SCIENCES
Volume 586, Issue -, Pages 540-562Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2021.12.014
Keywords
Multi-objective optimization; Multi-objective multi-task optimization; Multifactorial evolutionary algorithm; Evolutionary multi-tasking
Categories
Funding
- National Natural Science Foundation of China [61871272, 61976143, 61975135]
- International Cooperation and Exchanges NSFC [61911530218]
- Guangdong Basic and Applied Basic Research Foundation [2019A1515010869, 2020A151501946]
- Guangdong Provincial Key Laboratory [2020B121201001]
- Shenzhen Fundamental Research Program [JCYJ20190808173617147, BGIRSZ20200002]
- Scientific Research Foundation of Shenzhen University [85304/00000247]
Ask authors/readers for more resources
This paper proposes a new multi-objective evolutionary multi-task optimization (EMTO) algorithm by introducing cross-dimensional variable search and prediction-based individual search for efficient knowledge transfer. The algorithm is tested on benchmark problems and the experimental results demonstrate its effectiveness and efficiency.
Transfer learning is an important research topic in machine learning and recently has been introduced into evolutionary computation to form evolutionary multi-task optimization (EMTO). EMTO focuses on tackling multiple optimization tasks simultaneously based on knowledge transfer and reuse. Many EMTO algorithms have been proposed mainly for single-objective optimization problems and achieved success in various fields, yet multi objective EMTO remains a big challenge. The existing multi-objective EMTO algorithms tend to suffer from issues like slow convergence and degraded performance on less correlated tasks. To alleviate these issues, this paper proposes a new multi-objective EMTO algorithm by introducing cross-dimensional variable search and prediction-based individual search for efficient knowledge transfer. The cross-dimensional variable search optimizes a decision variable using information collected from other variables. The prediction based individual search performs individual mapping where the offspring solutions and the corresponding parent solutions are symmetrized about the predicted population center to maintain the population diversity. The proposed algorithm is tested on benchmark problems and the experimental results demonstrate the effectiveness and efficiency of the algorithm.(c) 2021 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available