Open AccessPerformance analysis of DE mutation schemes for constrained LSGO problems
Author(s) -
Aleksei Vakhnin,
Evgenii Sopov,
D. V. Kustov,
Ilia Panfilov
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1399/3/033111
Subject(s) - benchmark (surveying) , mutation , differential evolution , mathematical optimization , range (aeronautics) , set (abstract data type) , dimension (graph theory) , scheme (mathematics) , optimization problem , computer science , population , global optimization , mathematics , algorithm , engineering , biology , mathematical analysis , biochemistry , demography , geodesy , aerospace engineering , sociology , gene , pure mathematics , programming language , geography
Differential Evolution (DE) is one of the most popular evolution algorithms (EAs) for numerical optimization problems with various difficulty levels. Mutation scheme makes a strong influence in DE performance. It produces new trial vectors based on the current population to improve the previous best-found solution. In this paper, we have analyzed the performance of a wide range of various mutation schemes for early proposed ε-CC-SHADE algorithm. We have used scaled benchmark set of constrained large-scale global optimization (cLSGO) problems to investigate ε-CC-SHADE performance. The new benchmark set is based on IEEE CEC 2017 Competition on Constrained Real-Parameter Optimization. The experimental results have shown the dependence of EA performance on the selected mutation scheme for solving optimization problems with high dimension. Based on the numerical results, we have made conclusions for choosing mutation scheme to increase DE performance for cLSGO.