Decoupling Constraint from Two Direction in Evolutionary Constrained Multi-objective Optimization
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917175372021760 |
|---|---|
| author | Sun, Ruiqing Feng, Dawei Zhou, Xing Li, Lianghao Qi, Sheng Ding, Bo Wang, Yijie Wang, Rui Wang, Huaimin |
| author_facet | Sun, Ruiqing Feng, Dawei Zhou, Xing Li, Lianghao Qi, Sheng Ding, Bo Wang, Yijie Wang, Rui Wang, Huaimin |
| contents | Real-world Constrained Multi-objective Optimization Problems (CMOPs) often contain multiple constraints, and understanding and utilizing the coupling between these constraints is crucial for solving CMOPs. However, existing Constrained Multi-objective Evolutionary Algorithms (CMOEAs) typically ignore these couplings and treat all constraints as a single aggregate, which lacks interpretability regarding the specific geometric roles of constraints. To address this limitation, we first analyze how different constraints interact and show that the final Constrained Pareto Front (CPF) depends not only on the Pareto fronts of individual constraints but also on the boundaries of infeasible regions. This insight implies that CMOPs with different coupling types must be solved from different search directions. Accordingly, we propose a novel algorithm named Decoupling Constraint from Two Directions (DCF2D). This method periodically detects constraint couplings and spawns an auxiliary population for each relevant constraint with an appropriate search direction. Extensive experiments on seven challenging CMOP benchmark suites and on a collection of real-world CMOPs demonstrate that DCF2D outperforms five state-of-the-art CMOEAs, including existing decoupling-based methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_23945 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Decoupling Constraint from Two Direction in Evolutionary Constrained Multi-objective Optimization Sun, Ruiqing Feng, Dawei Zhou, Xing Li, Lianghao Qi, Sheng Ding, Bo Wang, Yijie Wang, Rui Wang, Huaimin Neural and Evolutionary Computing Real-world Constrained Multi-objective Optimization Problems (CMOPs) often contain multiple constraints, and understanding and utilizing the coupling between these constraints is crucial for solving CMOPs. However, existing Constrained Multi-objective Evolutionary Algorithms (CMOEAs) typically ignore these couplings and treat all constraints as a single aggregate, which lacks interpretability regarding the specific geometric roles of constraints. To address this limitation, we first analyze how different constraints interact and show that the final Constrained Pareto Front (CPF) depends not only on the Pareto fronts of individual constraints but also on the boundaries of infeasible regions. This insight implies that CMOPs with different coupling types must be solved from different search directions. Accordingly, we propose a novel algorithm named Decoupling Constraint from Two Directions (DCF2D). This method periodically detects constraint couplings and spawns an auxiliary population for each relevant constraint with an appropriate search direction. Extensive experiments on seven challenging CMOP benchmark suites and on a collection of real-world CMOPs demonstrate that DCF2D outperforms five state-of-the-art CMOEAs, including existing decoupling-based methods. |
| title | Decoupling Constraint from Two Direction in Evolutionary Constrained Multi-objective Optimization |
| topic | Neural and Evolutionary Computing |
| url | https://arxiv.org/abs/2512.23945 |