.png){kind=icon}
.png){kind=icon}
Return
ε 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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Constrained optimization problem
epsilon Constrained method
Differential evolution
Halfspace partition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.4
Papers:
3.5K
Citations:
1.1W