Open Access

ARTICLE

Constraint Intensity-Driven Evolutionary Multitasking for Constrained Multi-Objective Optimization

Leyu Zheng¹, Mingming Xiao^1,*, Yi Ren², Ke Li¹, Chang Sun¹

1 Smart City College, Beijing Union University, Beijing, 100101, China
2 Luban (Beijing) E-commerce Technology Co., Ltd., Beijing, 102308, China

* Corresponding Author: Mingming Xiao. Email:

(This article belongs to the Special Issue: Advancements in Evolutionary Optimization Approaches: Theory and Applications)

Computers, Materials & Continua 2026, 86(3), 51 https://doi.org/10.32604/cmc.2025.072036

Received 18 August 2025; Accepted 24 October 2025; Issue published 12 January 2026

Abstract

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 Intensity-Driven 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.

---

Keywords

---

Supplementary Material

Supplementary Material File

---