文献类型：期刊文献

英文题名：Enhancing Constrained Multi-Objective Optimization via Knowledge Transfer and Co-Evolution

作者：Zheng, Leyu[1]; Li, Ke[1]; Sun, Chang[1]; Xiao, Mingming[1]

第一作者：Zheng, Leyu

机构：[1] Smart City College, Beijing Union University, Beijing, 100101, China

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

通讯机构：[1]Smart City College, Beijing Union University, Beijing, 100101, China|[1141734]北京联合大学智慧城市学院;[11417]北京联合大学;

年份：2026

卷号：19

期号：1

外文期刊名：International Journal of Computational Intelligence Systems

收录：EI(收录号：20260419971718);Scopus(收录号：2-s2.0-105028310884)

语种：英文

外文关键词：Benchmarking - Constrained optimization - Knowledge management - Knowledge transfer - Multiobjective optimization

摘要：In constrained multi-objective optimization problems (CMOPs), two critical challenges persist for existing algorithms: effectively traversing infeasible regions based on problem-specific characteristics and utilizing auxiliary populations for efficient knowledge transfer to enhance solution set feasibility, convergence, and diversity. This paper proposes a novel approach, called Enhancing Knowledge Transfer Evolutionary Multi-Objective Optimization (EKTEMO), which exploits the set relationship between the constrained Pareto front (CPF) and the unconstrained Pareto front (UPF) to enhance knowledge transfer. EKTEMO adopts a two-population co-evolutionary strategy. During the learning phase, specialized evolutionary operators guide the independent evolution of both the CPF and UPF populations. Feasibility and non-dominance criteria are used to determine the relationship type between the two populations. In the evolutionary phase, each population is assigned a distinct evolutionary operator based on the type of problem. The main population continues to focus on obtaining CPF, while the auxiliary populations adapt and support this goal through different strategies or complementary functions. In addition, an appropriate knowledge transfer mechanism is selected based on the effectiveness of knowledge from parents and offspring. This ensures that the main population can efficiently utilize information from the auxiliary population to generate feasible, convergent, and diverse solutions. Comprehensive experiments across 46 benchmark test functions and 10 real-world problems, comparing EKTEMO with nine state-of-the-art algorithms, demonstrate its superior performance in terms of inverted generational distance and hypervolume, as confirmed by Wilcoxon rank-sum test results. These findings underscore the effectiveness and robustness of EKTEMO in solving CMOPs. ? The Author(s) 2025.