On three new approaches to handle constraints within evolution strategies

Evolutionary algorithms with a self-adaptive step control mechanism like evolution strategies (ES) often suffer from premature fitness stagnation on constrained numerical optimization problems. When the optimum lies on the constraint boundary or even in a vertex of the feasible search space, a disadvantageous success probability results in premature step size reduction. We introduce three new constraint-handling methods for ES on constrained continuous search spaces. The death penalty step control evolution strategy (DSES) is based on the controlled reduction of a minimum step size depending on the distance to the infeasible search space. The two sexes evolution strategy (TSES) is inspired by the biological concept of sexual selection and pairing. At last, the nested angle evolution strategy (NAES) is an approach in which the angles of the correlated mutation of the inner ES are adapted by the outer ES. All methods are experimentally evaluated on four selected test problems and compared with existing penalty-based constraint-handling methods.

[1]  José L. Verdegay,et al.  Evolutionary Techniques for Constrained Optimization Problems , 1999 .

[2]  K. Deb An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[3]  Carlos Artemio Coello-Coello,et al.  Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art , 2002 .

[4]  Hans-Paul Schwefel,et al.  Evolution strategies – A comprehensive introduction , 2002, Natural Computing.

[5]  Jan Paredis,et al.  Co-evolutionary Constraint Satisfaction , 1994, PPSN.

[6]  Carlos A. Coello Coello,et al.  THEORETICAL AND NUMERICAL CONSTRAINT-HANDLING TECHNIQUES USED WITH EVOLUTIONARY ALGORITHMS: A SURVEY OF THE STATE OF THE ART , 2002 .

[7]  C. Coello TREATING CONSTRAINTS AS OBJECTIVES FOR SINGLE-OBJECTIVE EVOLUTIONARY OPTIMIZATION , 2000 .

[8]  Zbigniew Michalewicz,et al.  Evolutionary Computation at the Edge of Feasibility , 1996, PPSN.

[9]  Michael M. Skolnick,et al.  Using Genetic Algorithms in Engineering Design Optimization with Non-Linear Constraints , 1993, ICGA.

[10]  Christopher R. Houck,et al.  On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[11]  Ángel Fernando Kuri Morales,et al.  A UNIVERSAL ECLECTIC GENETIC ALGORITHM FOR CONSTRAINED OPTIMIZATION , 2022 .

[12]  Carlos A. Coello Coello,et al.  Use of a self-adaptive penalty approach for engineering optimization problems , 2000 .

[13]  Atidel B. Hadj-Alouane,et al.  A dual genetic algorithm for bounded integer programs James C. Bean, Atidel Ben Hadj-Alouane. , 1993 .

[14]  Abdollah Homaifar,et al.  Constrained Optimization Via Genetic Algorithms , 1994, Simul..

[15]  Patrick D. Surry,et al.  A Multi-objective Approach to Constrained Optimisation of Gas Supply Networks: the COMOGA Method , 1995, Evolutionary Computing, AISB Workshop.

[16]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.

[17]  Raphael T. Haftka,et al.  A Segregated Genetic Algorithm for Constrained Structural Optimization , 1995, ICGA.

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

[19]  Carlos A. Coello Coello,et al.  A simple multimembered evolution strategy to solve constrained optimization problems , 2005, IEEE Transactions on Evolutionary Computation.

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

[21]  Frank Hoffmeister,et al.  Problem-Independent Handling of Constraints by Use of Metric Penalty Functions , 1996, Evolutionary Programming.

[22]  Marc Schoenauer,et al.  Constrained GA Optimization , 1993, ICGA.

[23]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[24]  G. McCormick,et al.  THE SEQUENTIAL UNCONSTRAINED MINIMIZATION TECHNIQUE FOR NONLINEAR PROGRAMMING. ALGORITHM II. OPTIMUM GRADIENTS BY FIBONACCI SEARCH , 1964 .