A Simple Evolution Strategy to Solve Constrained Optimization Problems


Efrén Mezura-Montes proposed some relatively simple, but rather effective mechanisms to enhance the performance of a multimembered evolution strategy used to solve constrained optimization problems. The approach does not require the use of a penalty function. Instead, it uses a simple diversity mechanism based on allowing infeasible solutions to remain in the population. This technique helps the algorithm to find the global optimum despite reaching reasonably fast the feasible region of the search space. A simple feasibility-based comparison mechanism is used to guide the process towards the feasible region of the search space. Also, the initial stepsize of the evolution strategy is reduced in order to perform a finer search and a combined (discrete/intermediate) panmictic recombination technique improves its exploitation capabilities. The source code of this approach is available here.


The source code of this approach is available here.


For further information about this approach, please refer to:


  1. Efrén Mezura Montes and Carlos A. Coello Coello, A Simple Multi-Membered Evolution Strategy to Solve Constrained Optimization Problems, IEEE Transactions on Evolutionary Computation, Vol. 9, No. 1, February 2005.


  2. Efrén Mezura-Montes and Carlos A. Coello Coello, An Improved Diversity Mechanism for Solving Constrained Optimization Problems using a Multimembered Evolution Strategy, in Kalyanmoy Deb et al. (editors), Genetic and Evolutionary Computation--GECCO 2004. Proceedings of the Genetic and Evolutionary Computation Conference, Springer-Verlag, Lecture Notes in Computer Science Vol. 3102, pp. 700--712, Seattle, Washington, USA, June 2004.