文献类型：期刊文献

中文题名：Constraint Intensity-Driven Evolutionary Multitasking for Constrained Multi-Objective Optimization

作者：Leyu Zheng[1];Mingming Xiao[1];Yi Ren[2];Ke Li[1];Chang Sun[1]

第一作者：Leyu Zheng

机构：[1]Smart City College,Beijing Union University,Beijing,100101,China;[2]Luban(Beijing)E-commerce Technology Co.,Ltd.,Beijing,102308,China

第一机构：北京联合大学智慧城市学院

年份：2026

卷号：86

期号：3

起止页码：1241-1261

中文期刊名：Computers, Materials & Continua

外文期刊名：计算机、材料和连续体(英文)

基金：supported by the National Natural Science Foundation of China under Grant No.61972040;the Science and Technology Research and Development Project funded by China Railway Material Trade Group Luban Company.

语种：英文

中文关键词：Constrained multi-objective optimization;evolutionary algorithm;evolutionary multitasking;knowledge transfer

摘要：In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and reduces population diversity.To address these challenges,we propose a novel algorithm named Constraint IntensityDriven Evolutionary Multitasking(CIDEMT),which employs a two-stage,tri-task framework to dynamically integrates problem structure and knowledge transfer.In the first stage,three cooperative tasks are designed to explore the Constrained Pareto Front(CPF),the Unconstrained Pareto Front(UPF),and theε-relaxed constraint boundary,respectively.A CPF-UPF relationship classifier is employed to construct a problem-type-aware evolutionary strategy pool.At the end of the first stage,each task selects strategies from this strategy pool based on the specific type of problem,thereby guiding the subsequent evolutionary process.In the second stage,while each task continues to evolve,aτ-driven knowledge transfer mechanism is introduced to selectively incorporate effective solutions across tasks.enhancing the convergence and feasibility of the main task.Extensive experiments conducted on 32 benchmark problems from three test suites(LIRCMOP,DASCMOP,and DOC)demonstrate that CIDEMT achieves the best Inverted Generational Distance(IGD)values on 24 problems and the best Hypervolume values(HV)on 22 problems.Furthermore,CIDEMT significantly outperforms six state-of-the-art constrained multi-objective evolutionary algorithms(CMOEAs).These results confirm CIDEMT’s superiority in promoting convergence,diversity,and robustness in solving complex CMOPs.