Loading…
ε Constrained differential evolution using halfspace partition for optimization problems
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...
Saved in:
Published in: | Journal of intelligent manufacturing 2021, Vol.32 (1), p.157-178 |
---|---|
Main Authors: | , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
ISSN: | 0956-5515 1572-8145 |
DOI: | 10.1007/s10845-020-01565-2 |