.png){kind=icon}
返回
Constrained multi-objective differential evolution algorithm with ranking mutation operator
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2022.118055.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
There are feasible and infeasible solutions in Constrained Multi-objective Optimization Problems (CMOPs). The feasible solutions with lower rank should be given more chances to generate offspring, while infeasible and worse solutions with higher rank should have fewer chances in these CMOPs. A constrained multi-objective Differential Evolution (DE) algorithm is developed by considering the selection pressure. The population is ranked based on the non-dominated crowd sort and constrained dominated principle. Then, a tournament operator is designed to extend the conventional mutation operator to boost the exploitation. The performances of the proposed algorithm are assessed on nineteen benchmark functions and industrial applications. Five representative algorithms are selected to make comparisons. The experiments have demonstrated that the algorithm can find well-distributed Pareto front, and the result of the performance indicator is superior.
Keyword:
CMOPs
Differential evolution
Mutation operator
Ranking
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
暂无机构信息
引用论文
Differential evolution mutation operators for constrained multi-objective optimization约束多目标优化的差分进化变异算子
PREAI
分享收藏分享收藏
An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏
查看更多内容