arrow
Return

Evolutionary Multitask Framework With Bi-Knowledge Transfer for Multimodal Optimization Problems

delete2025-03-17
delete0
PRE
AI
H
Hong Zhao
H
Hong Zhao
黎建宇 cover
黎建宇 (Jian-Yu Li)
刘晶 (Jing Liu)
DOI:10.1109/TEVC.2025.3551728delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Solving multimodal optimization problems (MMOPs) is a challenging task which needs locating multiple global optimal solutions simultaneously with high accuracy. Current popular niching-based evolutionary algorithms (EAs) for solving MMOPs usually divide the population into several separate species to search for different optimal solutions. However, achieving effective information exchange between species to enhance the performance of overall algorithm remains a challenge in current niching-based EAs, which will directly affect the efficiency of the multimodal optimization algorithm. In this article, the process of the different species locating peaks in MMOPs is regarded as an evolutionary multitask (EMT) optimization problem and an EMT framework with bi-knowledge transfer for MMOPs is proposed. An explicit knowledge transfer (E-KT) strategy is designed to transfer the optimal individual of the species with the fastest convergence speed to other species, thereby facilitating the acceleration their convergence. Moreover, in order to further improve the information exchange between species, a species-center-based implicit knowledge transfer (I-SCKT) strategy is designed to improve the diversity of the population. The performance of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${\mathrm { MTBKT}}_{\mathrm { MMOP}}$ </tex-math></inline-formula> is tested on the widely used CEC’2013 benchmark and five practical flexible job shop problems. The experimental results of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${\mathrm { MTBKT}}_{\mathrm { MMOP}}$ </tex-math></inline-formula> are compared with nine state-of-the-art MMOPs algorithms and show that our <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${\mathrm { MTBKT}}_{\mathrm { MMOP}}$ </tex-math></inline-formula> is superior to all of them. Besides, the experimental results also show that the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${\mathrm { MTBKT}}_{\mathrm { MMOP}}$ </tex-math></inline-formula> achieves breakthroughs in handling with a large number of optimal solutions or high-dimensional MMOPs, which provides a new and effective method for dealing with MMOPs.
Keywords:
Differential evolution (DE)
evolutionary computation
knowledge transfer
multimodal optimization problem (MMOP)
multitasking
nearest-better clustering (NBC)

Journal

IEEE Transactions on Evolutionary Computation cover
IEEE Transactions on Evolutionary Computation
IF:
12
Papers:
1.8K
Citations:
2.4W

Organization

X
Xidian University
Scholars:
2.4W
Papers: 1.9W
Citations: 9.7K
N
nankai university
Scholars:
4.7W
Papers: 3.2W
Citations: 74