A Survey of Constraint Handling Techniques in Evolutionary Computation Methods

One of the major components of any evolutionary system is the evaluation function. Evaluation functions are used to assign a quality measure for individuals in a population. Whereas evolutionary computation techniques assume the existence of an (e cient) evaluation function for feasible individuals, there is no uniform methodology for handling (i.e., evaluating) unfeasible ones. The simplest approach, incorporated by evolution strategies and a version of evolutionary programming (for numerical optimization problems), is to reject unfeasible solutions. But several other methods for handling unfeasible individuals have emerged recently. This paper reviews such methods (using a domain of nonlinear programming problems) and discusses their merits and drawbacks.

[1]  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.

[2]  Gunar E. Liepins,et al.  Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.

[3]  J. D. Schaffer,et al.  Some experiments in machine learning using vector evaluated genetic algorithms (artificial intelligence, optimization, adaptation, pattern recognition) , 1984 .

[4]  Jack Sklansky,et al.  Constrained Genetic Optimization via Dynarnic Reward-Penalty Balancing and Its Use in Pattern Recognition , 1989, ICGA.

[5]  Ingo Rechenberg,et al.  Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

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

[7]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

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

[9]  Lawrence Davis,et al.  Shall We Repair? Genetic AlgorithmsCombinatorial Optimizationand Feasibility Constraints , 1993, ICGA.

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

[11]  Thomas Bäck,et al.  A Survey of Evolution Strategies , 1991, ICGA.

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

[13]  Z. Michalewicz Genetic Algorithms , Numerical Optimization , and Constraints , 1995 .

[14]  Zbigniew Michalewicz,et al.  Evolutionary optimization of constrained problems , 1994 .

[15]  Zbigniew Michalewicz,et al.  Using Cultural Algorithms for Constraint Handling in GENOCOP , 1995, Evolutionary Programming.

[16]  Alden H. Wright,et al.  Genetic Algorithms for Real Parameter Optimization , 1990, FOGA.

[17]  Zbigniew Michalewicz,et al.  Handling Constraints in Genetic Algorithms , 1991, ICGA.

[18]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[19]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[20]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[21]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

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

[23]  L. C. Stayton,et al.  On the effectiveness of crossover in simulated evolutionary optimization. , 1994, Bio Systems.

[24]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .