.png){kind=icon}
返回
ε Constrained differential evolution using halfspace partition for optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10845-020-01565-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
There are many efficient and effective constraint-handling mechanisms for constrained optimization problems. However, most of them evaluate all the individuals, including the worse individuals, which waste a lot of fitness evaluations. In this paper, halfspace partition mechanism based on constraint violation values is proposed. Since constraint violation information of individuals in current generation are already known, the positive side of tangent line of one point as positive halfspace is defined. A point is treated as potential point if it locates in the intersect region of two positive halfspaces. Hence, the region includes all these points has greater possibility to obtain smaller constraint violation. Only when the offspring locates in this area, the actual objective function value and constraint violation will be calculated. The estimated worse individuals will be omitted without calculating actual constraint violation and fitness function value. Four engineering optimization and a case study with the grinding optimization process are studied. The experimental results verify the effectiveness of the proposed mechanism.
Keyword:
Constrained optimization problem
epsilon Constrained method
Differential evolution
Halfspace partition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.4
论文数:
3.5K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容