Multiobjective Multitasking Optimization With Decomposition-Based Transfer Selection

doi:10.1109/TCYB.2023.3266241

Multiobjective Multitasking Optimization With Decomposition-Based Transfer Selection

2024-05-01

2

PRE

AI

Carlos A. Coello Coello

DOI：10.1109/TCYB.2023.3266241

Original

Original request for help

Save

Abstract

En 中文

Multiobjective multitasking optimization (MTO) needs to solve a set of multiobjective optimization problems simultaneously, and tries to speed up their solution by transferring useful search experiences across tasks. However, the quality of transfer solutions will significantly impact the transfer effect, which may even deteriorate the optimization performance with an improper selection of transfer solutions. To alleviate this issue, this article suggests a new multiobjective multitasking evolutionary algorithm (MMTEA) with decomposition-based transfer selection, called MMTEA-DTS. In this algorithm, all tasks are first decomposed into a set of subproblems, and then the transfer potential of each solution can be quantified based on the performance improvement ratio of its associated subproblem. Only high-potential solutions are selected to promote knowledge transfer. Moreover, to diversify the transfer of search experiences, a hybrid transfer evolution method is designed in this article. In this way, more diverse search experiences are transferred from high-potential solutions across different tasks to speed up their convergence. Three well-known benchmark suites suggested in the competition of evolutionary MTO and one real-world problem suite are used to verify the effectiveness of MMTEA-DTS. The experiments validate its advantages in solving most of the test problems when compared to five recently proposed MMTEAs.

Keywords:

Decomposition

knowledge transfer

multiobjective optimization

multitasking optimization (MTO)

Multiobjective Multitasking Optimization With Decomposition-Based Transfer Selection

Abstract

Journal

Organization