dc.contributor.author |
Kumar, A. |
|
dc.contributor.author |
Das, S. |
|
dc.contributor.author |
Zelinka, I. |
|
dc.date.accessioned |
2020-10-15T11:38:58Z |
|
dc.date.available |
2020-10-15T11:38:58Z |
|
dc.date.issued |
2020-07-08 |
|
dc.identifier.isbn |
978-145037127-8 |
|
dc.identifier.uri |
http://localhost:8080/xmlui/handle/123456789/820 |
|
dc.description.abstract |
Most of the real-world black-box optimization problems are associated with multiple non-linear as well as non-convex constraints, making them difficult to solve. In this work, we introduce a variant of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) with linear timing complexity to adopt the constraints of Constrained Optimization Problems (COPs). CMA-ES is already well-known as a powerful algorithm for solving continuous, non-convex, and black-box optimization problems by fitting a second-order model to the underlying objective function (similar in spirit, to the Hessian approximation used by Quasi-Newton methods in mathematical programming). The proposed algorithm utilizes an e-constraint-based ranking and a repair method to handle the violation of the constraints. The experimental results on a group of real-world optimization problems show that the performance of the proposed algorithm is better than several other state-of-the-art algorithms in terms of constraint handling and robustness. © 2020 Owner/Author. |
en_US |
dc.description.sponsorship |
Association for Computing Machinery, Inc |
en_US |
dc.language.iso |
en_US |
en_US |
dc.publisher |
Association for Computing Machinery, Inc |
en_US |
dc.subject |
Linkage Learning |
en_US |
dc.subject |
Genetic Algorithm |
en_US |
dc.subject |
Parameter-less |
en_US |
dc.title |
A modified covariance matrix adaptation evolution strategy for real-world constrained optimization problems |
en_US |
dc.type |
Article |
en_US |