A modified covariance matrix adaptation evolution strategy for real-world constrained optimization problems
暂无分享,去创建一个
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.
[1] Guohua Wu,et al. A test-suite of non-convex constrained optimization problems from the real-world and some baseline results , 2020, Swarm Evol. Comput..
[2] Hans-Georg Beyer,et al. A Matrix Adaptation Evolution Strategy for Constrained Real-Parameter Optimization , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).
[3] Petros Koumoutsakos,et al. Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES) , 2003, Evolutionary Computation.