.png){kind=icon}
返回
A pareto fronts relationship identification-based two-stage constrained evolutionary algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2024.111674.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Striking a balance between diverse constraints and conflicting objectives is one of the most crucial issues in solving constrained multi -objective optimization problems (CMOPs). However, it remains challenging to existing methods, due to the reduced search space caused by the constraints. For this issue, this paper proposes a Pareto fronts relationship identification -based two -stage constrained evolutionary algorithm called RITEA, which balances objective optimization and constraint satisfaction by identifying and utilizing the relationship between the unconstrained Pareto front (UPF) and the constrained Pareto front (CPF). Specifically, the evolutionary process is divided into two collaborative stages: training stage and reinforcement stage. In the training stage, a relationship identification method is developed to estimate the relationship between UPF and CPF, which guides the population search direction. In the reinforcement stage, the corresponding evolutionary strategies are designed based on the identified relationship to enhance the accurate search on the CPF. Furthermore, a dynamic preference fitness function (termed DPF ) is designed to adaptively maintain the balance of search preference between convergence and diversity. Compared to seven state-of-the-art algorithms on 36 benchmark CMOPs in three popular test suites, RITEA obtains 77.8% of the best IGD values and 66.7% of the best HV values. The experimental results show that RITEA exhibits highly competitively when dealing with CMOPs.
Keyword:
Constrained multi-objective optimization
Evolutionary algorithm
Pareto fronts relationship identification
Two-stage
Dynamic preference fitness function
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective OptimizationPlatEMO: 用于进化多目标优化的MATLAB平台
OAAI
OAAI分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏分享收藏An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏
查看更多内容