Dynamic multitask optimization with improved knowledge transfer mechanism

被引:1
作者
Ren, Kun [1 ,2 ]
Xiao, Fu-Xia [1 ,2 ]
Han, Hong-Gui [1 ,2 ,3 ]
机构
[1] Beijing Univ Technol, Fac Informat Technol, Beijing 100124, Peoples R China
[2] Minist Educ, Engn Res Ctr Digital Community, Beijing 100124, Peoples R China
[3] Beijing Univ Technol, Artificial Intelligence Inst & Beijing Lab Intell, Beijing 100124, Peoples R China
基金
北京市自然科学基金; 美国国家科学基金会;
关键词
Dynamic multitask optimization; Particle swarm optimization; Dynamic multi-objective optimization; Knowledge transfer; MULTIOBJECTIVE OPTIMIZATION; ALGORITHM; DECOMPOSITION;
D O I
10.1007/s10489-022-03282-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multitasking optimization (MTO) is promising to become the next-generation mainstream optimization paradigm for optimizing multiple tasks simultaneously with high efficiency and accuracy. However, despite dynamic tasks abound in the real world, such as flow shop scheduling, vehicle routing, IoT, machine learning, research on dynamic multitask optimization (DMTO) has been rarely reported. DMTO problems are more challenging than MTO with static tasks or a single dynamic optimization. In this paper, a dynamic multitask optimization algorithm with an improved knowledge transfer mechanism (IK_DMTO) is proposed to solve the DMTO problems. Firstly, an improved knowledge transfer mechanism is designed to promote knowledge utilization by conditionally selecting the scale of knowledge transfer and reduce negative migration by selectively performing the crossover operation between tasks. Secondly, a new individual information update strategy is applied to guide the individual updates, in which the leaders of the sub-populations formed during the knowledge transfer process are utilized to adjust the direction of individuals to make the utmost of knowledge between tasks, and an external archive management strategy is introduced to achieve a better distribution of non-dominated solutions. Finally, nine dynamic multi-objective multitask optimization (DMOMTO) problems are constructed with the dynamic multi-objective benchmark functions to verify the effectiveness of IK_DMTO. The experimental results show that IK_DMTO can perform well on convergence compared to the comparison algorithms.
引用
收藏
页码:1666 / 1682
页数:17
相关论文
共 42 条
[21]  
Koo WT., 2010, Memetic Comput, V2, P87, DOI [10.1007/s12293-009-0026-7, DOI 10.1007/S12293-009-0026-7]
[22]  
Lechuga S, 2009, THESIS U BIRMINGHAM
[23]   Evolutionary Multitasking for Multiobjective Optimization With Subspace Alignment and Adaptive Differential Evolution [J].
Liang, Zhengping ;
Dong, Hao ;
Liu, Cheng ;
Liang, Weiqi ;
Zhu, Zexuan .
IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (04) :2096-2109
[24]   An Effective Knowledge Transfer Approach for Multiobjective Multitasking Optimization [J].
Lin, Jiabin ;
Liu, Hai-Lin ;
Tan, Kay Chen ;
Gu, Fangqing .
IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (06) :3238-3248
[25]   A dynamic multiple populations particle swarm optimization algorithm based on decomposition and prediction [J].
Liu, Ruochen ;
Li, Jianxia ;
Fan, Jing ;
Jiao, Licheng .
APPLIED SOFT COMPUTING, 2018, 73 :434-459
[26]   A survey of swarm intelligence for dynamic optimization: Algorithms and applications [J].
Mavrovouniotis, Michalis ;
Li, Changhe ;
Yang, Shengxiang .
SWARM AND EVOLUTIONARY COMPUTATION, 2017, 33 :1-17
[27]   Multifactorial Cellular Genetic Algorithm (MFCGA): Algorithmic Design, Performance Comparison and Genetic Transferability Analysis [J].
Osaba, Eneko ;
Martinez, Aritz D. ;
Lobo, Jesus L. ;
Del Ser, Javier ;
Herrera, Francisco .
2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
[28]   AT-MFCGA: An Adaptive Transfer-guided Multifactorial Cellular Genetic Algorithm for Evolutionary Multitasking [J].
Osaba, Eneko ;
Del Ser, Javier ;
Martinez, Aritz D. ;
Lobo, Jesus L. ;
Herrera, Francisco .
INFORMATION SCIENCES, 2021, 570 :577-598
[29]  
Raquel C., 2013, Evolutionary Computation for Dynamic Optimization Problems, P85
[30]  
Song H, 2019, IEEE C EVOL COMPUTAT, P1937, DOI [10.1109/CEC.2019.8790009, 10.1109/cec.2019.8790009]