Decoupling Constraint: Task Clone-Based Multitasking Optimization for Constrained Multiobjective Optimization

被引:16
作者
Li, Genghui [1 ,2 ]
Wang, Zhenkun [2 ,3 ]
Gao, Weifeng [4 ]
Wang, Ling [5 ]
机构
[1] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China
[2] Southern Univ Sci & Technol, Sch Syst Design & Intelligent Mfg, Shenzhen 518055, Peoples R China
[3] Southern Univ Sci & Technol, Dept Comp Sci & Engn, Shenzhen 518055, Peoples R China
[4] Xidian Univ, Sch Math & Stat, Xian 710126, Peoples R China
[5] Tsinghua Univ, Dept Automat, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
Task analysis; Optimization; Statistics; Sociology; Evolutionary computation; Convergence; Cloning; Constrained multiobjective optimization; constraint decoupling; information transfer; task clone; EVOLUTIONARY ALGORITHM; DUAL-POPULATION; MOEA/D; SUITE;
D O I
10.1109/TEVC.2024.3358854
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The coupling of multiple constraints can pose difficulties in solving constrained multiobjective optimization problems (CMOPs). Existing constrained multiobjective evolutionary algorithms (CMOEAs) often overlook this issue by considering all constraints together. This article proposes MTOTC, a novel multitasking optimization algorithm that addresses this challenge through a task clone technique. MTOTC clones the target CMOP with q constraints into q+1 copies, resulting in a total of q+2 tasks. Each cloned task is handled using an independent population that considers a unique constraint-handling sequence, effectively decoupling the constraints in q+1 different ways. Additionally, the algorithm incorporates online information sharing between the target task and cloned tasks, enabling the utilization of valuable search history as much as possible. Experimental results on four recently developed complex CMOP benchmark suites and a series of real-world CMOPs demonstrate the superior performance of MTOTC compared to seven state-of-the-art CMOEAs.
引用
收藏
页码:404 / 417
页数:14
相关论文
共 79 条
[1]   Constrained multi-objective optimization algorithms: Review and comparison with application in reinforced concrete structures [J].
Afshari, Hamid ;
Hare, Warren ;
Tesfamariam, Solomon .
APPLIED SOFT COMPUTING, 2019, 83
[2]  
Babu BV, 2003, IEEE C EVOL COMPUTAT, P2696
[3]   Multifactorial Evolutionary Algorithm With Online Transfer Parameter Estimation: MFEA-II [J].
Bali, Kavitesh Kumar ;
Ong, Yew Soon ;
Gupta, Abhishek ;
Tan, Puay Siew .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (01) :69-83
[4]   A dual-population based bidirectional coevolution algorithm for constrained multi-objective optimization problems [J].
Bao, Qian ;
Wang, Maocai ;
Dai, Guangming ;
Chen, Xiaoyu ;
Song, Zhiming ;
Li, Shuijia .
EXPERT SYSTEMS WITH APPLICATIONS, 2023, 215
[5]   An archive-based two-stage evolutionary algorithm for constrained multi-objective optimization problems [J].
Bao, Qian ;
Wang, Maocai ;
Dai, Guangming ;
Chen, Xiaoyu ;
Song, Zhiming ;
Li, Shuijia .
SWARM AND EVOLUTIONARY COMPUTATION, 2022, 75
[6]   Evolutionary Multitasking for Feature Selection in High-Dimensional Classification via Particle Swarm Optimization [J].
Chen, Ke ;
Xue, Bing ;
Zhang, Mengjie ;
Zhou, Fengyu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2022, 26 (03) :446-460
[7]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[8]   A tri-stage competitive swarm optimizer for constrained multi-objective optimization [J].
Dong, Jun ;
Gong, Wenyin ;
Ming, Fei .
APPLIED INTELLIGENCE, 2023, 53 (07) :7892-7916
[9]   A two-stage evolutionary algorithm based on three indicators for constrained multi-objective optimization [J].
Dong, Jun ;
Gong, Wenyin ;
Ming, Fei ;
Wang, Ling .
EXPERT SYSTEMS WITH APPLICATIONS, 2022, 195
[10]   An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions [J].
Fan, Zhun ;
Li, Wenji ;
Cai, Xinye ;
Huang, Han ;
Fang, Yi ;
You, Yugen ;
Mo, Jiajie ;
Wei, Caimin ;
Goodman, Erik .
SOFT COMPUTING, 2019, 23 (23) :12491-12510