Projection-based local search operator for multiple equality constraints within genetic algorithms

This paper presents a new operator for genetic algorithms that enhances convergence in the case of multiple nonlinear equality constraints. The proposed operator, named CQA-MEC (Constraint Quadratic Approximation for Multiple Equality Constraints), performs the steps: (i) the approximation of the non-linear constraints via quadratic functions; (ii) the determination of exact equality-constrained projections of some points onto the approximated constraint surface, via an iterative projection algorithm; and (iii) the re-insertion of the constraint- satisfying points in the genetic algorithm population. This operator can be interpreted both as a local search engine (that employs local approximations of constraint functions for correcting the feasibility) and a kind of elitism operator for equality constrained problems that plays the role of "fixing" the best estimates of the feasible set. The proposed operator has the advantage of not requiring any additional function evaluation per algorithm iteration, solely making usage of the information that is already obtained in the course of the usual genetic algorithm iterations. The test cases that were performed suggest that the new operator can enhance both the convergence speed (in terms of the number of function evaluations) and the accuracy of the final result.

[1]  Frederico G. Guimarães,et al.  A Quadratic Approximation-Based Local Search Procedure for Multiobjective Genetic Algorithms , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[2]  Frederico G. Guimarães,et al.  Constraint quadratic approximation operator for treating equality constraints with genetic algorithms , 2005, 2005 IEEE Congress on Evolutionary Computation.

[3]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[4]  Ricardo H. C. Takahashi,et al.  The real-biased multiobjective genetic algorithm and its application to the design of wire antennas , 2003 .

[5]  M.A. Jabbar,et al.  Design optimization for cogging torque minimization using response surface methodology , 2004, IEEE Transactions on Magnetics.

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

[7]  Ricardo H. C. Takahashi,et al.  A multiobjective methodology for evaluating genetic operators , 2003 .

[8]  Frederico G. Guimarães,et al.  Quadratic Approximation-Based Coordinate Change in Genetic Algorithms , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[9]  Robert Spence,et al.  Response surface models of electromagnetic devices and their application to design , 1999 .

[10]  K. Rasheed,et al.  An incremental-approximate-clustering approach for developing dynamic reduced models for design optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[11]  Meng-Sing Liou,et al.  Multiobjective optimization using coupled response surface model and evolutionary algorithm , 2004 .

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

[13]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[14]  Christine A. Shoemaker,et al.  Local function approximation in evolutionary algorithms for the optimization of costly functions , 2004, IEEE Transactions on Evolutionary Computation.

[15]  Peter J. Fleming,et al.  Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation , 1998, IEEE Trans. Syst. Man Cybern. Part A.