A (1+1)-CMA-ES for constrained optimisation

This paper introduces a novel constraint handling approach for covariance matrix adaptation evolution strategies (CMA-ES). The key idea is to approximate the directions of the local normal vectors of the constraint boundaries by accumulating steps that violate the respective constraints, and to then reduce variances of the mutation distribution in those directions. The resulting strategy is able to approach the boundary of the feasible region without being impeded in its ability to search in directions tangential to the boundaries. The approach is implemented in the (1+1)-CMA-ES and evaluated numerically on several test problems. The results compare very favourably with data for other constraint handling approaches applied to unimodal test problems that can be found in the literature.

[1]  David Mautner Himmelblau,et al.  Applied Nonlinear Programming , 1972 .

[2]  Klaus Schittkowski,et al.  Test examples for nonlinear programming codes , 1980 .

[3]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[4]  Panos M. Pardalos,et al.  A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.

[5]  J. Rodriguez,et al.  Problem (2) , 1994 .

[6]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[7]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms for Constrained Parameter Optimization Problems , 1996, Evolutionary Computation.

[8]  K. Deb,et al.  An alternative constraint handling method for evolution strategies , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[9]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

[10]  Oliver Kramer,et al.  A new mutation operator for evolution strategies for constrained problems , 2005, 2005 IEEE Congress on Evolutionary Computation.

[11]  Dirk V. Arnold,et al.  Improving Evolution Strategies through Active Covariance Matrix Adaptation , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[12]  Oliver Kramer,et al.  On three new approaches to handle constraints within evolution strategies , 2006, Natural Computing.

[13]  Christian Igel,et al.  A computational efficient covariance matrix update and a (1+1)-CMA for evolution strategies , 2006, GECCO.

[14]  Tetsuyuki Takahama,et al.  Constrained Optimization by the ε Constrained Differential Evolution with Gradient-Based Mutation and Feasible Elites , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[15]  Nikolaus Hansen,et al.  Adaptive Encoding: How to Render Search Coordinate System Invariant , 2008, PPSN.

[16]  Dirk V. Arnold,et al.  On the Behaviour of the (1+1)-ES for a Simple Constrained Problem , 2008, PPSN.

[17]  Oliver Kramer,et al.  Surrogate Constraint Functions for CMA Evolution Strategies , 2009, KI.

[18]  Christian Igel,et al.  Efficient covariance matrix update for variable metric evolution strategies , 2009, Machine Learning.

[19]  Dirk V. Arnold,et al.  Active covariance matrix adaptation for the (1+1)-CMA-ES , 2010, GECCO.

[20]  Anne Auger,et al.  Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009 , 2010, GECCO '10.

[21]  Tetsuyuki Takahama,et al.  Efficient constrained optimization by the ε constrained adaptive differential evolution , 2010, IEEE Congress on Evolutionary Computation.

[22]  Anne Auger,et al.  Impacts of invariance in search: When CMA-ES and PSO face ill-conditioned and non-separable problems , 2011, Appl. Soft Comput..

[23]  Carlos A. Coello Coello,et al.  Constraint-handling in nature-inspired numerical optimization: Past, present and future , 2011, Swarm Evol. Comput..

[24]  Jacek M. Zurada,et al.  Swarm and Evolutionary Computation , 2012, Lecture Notes in Computer Science.

[25]  Marc Schoenauer,et al.  Multidisciplinary Optimization in the Design of Future Space Launchers , 2013 .