.png){kind=icon}
返回
A constrained multi-objective optimization algorithm using an efficient global diversity strategy
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-022-00851-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
When solving constrained multi-objective optimization problems (CMOPs), multiple conflicting objectives and multiple constraints need to be considered simultaneously, which are challenging to handle. Although some recent constrained multi-objective evolutionary algorithms (CMOEAs) have been developed to solve CMOPs and have worked well on most CMOPs. However, for CMOPs with small feasible regions and complex constraints, the performance of most algorithms needs to be further improved, especially when the feasible region is composed of multiple disjoint parts or the search space is narrow. To address this issue, an efficient global diversity CMOEA (EGDCMO) is proposed in this paper to solve CMOPs, where a certain number of infeasible solutions with well-distributed feature are maintained in the evolutionary process. To this end, a set of weight vectors are used to specify several subregions in the objective space, and infeasible solutions are selected from each subregion. Furthermore, a new fitness function is used in this proposed algorithm to evaluate infeasible solutions, which can balance the importance of constraints and objectives. In addition, the infeasible solutions are ranked higher than the feasible solutions to focus on the search in the undeveloped areas for better diversity. After the comparison tests on three benchmark cases and an actual engineering application, EGDCMO has more impressive performance compared with other constrained evolutionary multi-objective algorithms.
Keyword:
Constrained multi-objective optimization
Evolutionary algorithm
Constraint handling
Global diversity strategy
期刊
IF:
4.6
论文数:
2.1K
被引数:
6.6K
机构
引用论文
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
分享收藏Duality evolution: an efficient approach to constraint handling in multi-objective particle swarm optimization.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏分享收藏
查看更多内容