Publicaciones


 

Multiobjective Multitasking Optimization With Decomposition-Based Transfer Selection.

 

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, Multiobjective Multitasking Optimization (MTO).

Autores:

Carlos Artemio Coello Coello.

Revista

IEEE Transactions on Cybernetics.

DOI: 10.1109/TCYB.2023.3266241.

Print
CONTÁCTENOS

Logo Cinvestav

Av. Instituto Politécnico Nacional 2508
Col. San Pedro Zacatenco, Alcaldía Gustavo A. Madero
Ciudad de México, C.P. 07360
Apartado Postal: 14-740, 07000 Ciudad de México

Tel. +52 (55) 5747 3800

Cinvestav © 2025
23/09/2024 02:05:54 p. m.