Combined fitness–violation epsilon constraint handling for differential evolution

Over recent decades, several efficient constraint-handling methods have been proposed in the area of evolutionary computation, and the ε constraint method is considered as a state-of-the-art method for both single and multiobjective optimization. Still, very few attempts have been made to improve th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Soft computing (Berlin, Germany) Ročník 24; číslo 10; s. 7063 - 7079
Hlavní autoři: Stanovov, Vladimir, Akhmedova, Shakhnaz, Semenkin, Eugene
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2020
Springer Nature B.V
Témata:
Artificial Intelligence
Competition
Computational Intelligence
Constraints
Control
Engineering
Evolutionary algorithms
Evolutionary computation
Foundations
Handling
Inequality
Mathematical functions
Mathematical Logic and Foundations
Mechatronics
Methods
Multiple objective analysis
Optimization
Robotics
Violations
Constraint handling
Differential evolution
Constraint
Selective pressure
Constrained optimization
ISSN:1432-7643, 1433-7479
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Over recent decades, several efficient constraint-handling methods have been proposed in the area of evolutionary computation, and the ε constraint method is considered as a state-of-the-art method for both single and multiobjective optimization. Still, very few attempts have been made to improve this method when applied to the differential evolution algorithm. This study proposes several novel constraint-handling methods following similar ideas, where the ε level is defined based on the current violation in the population, individual ε levels are maintained for every constraint, and a combination of fitness and constraint violation is used for determining infeasible solutions. The proposed approaches demonstrate superior performance compared to other approaches in terms of the feasibility rate in high-dimensional search spaces, as well as convergence to global optima. The experiments are performed using the CEC’2017 constrained suite benchmark functions and a set of Economic Load Dispatch problems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1432-7643
1433-7479
DOI:10.1007/s00500-020-04835-6