Performance of infeasibility empowered memetic algorithm for CEC 2010 constrained optimization problems

Real life optimization problems often involve one or more constraints, and there is a significant interest among the research community to develop efficient algorithms to solve such constrained optimization problems. This paper presents a memetic algorithm combining the strengths of an evolutionary algorithm and a local search strategy. Since solutions of constrained optimization problems are expected to lie on constraint boundaries for most problems, the algorithm explicitly preserves marginally infeasible solutions to intensify search around the constraint boundaries. Furthermore, local search is done from solutions within the population to yield good quality solutions in early generations. The concepts of injecting high quality solutions in earlier generations and preservation of marginally infeasible solutions are both known to improve the efficiency of evolutionary algorithms for constrained optimization problems. The performance of the algorithm is presented on the newly proposed set of test functions (C01-C18)for 10 and 30 dimensions.

[1]  James C. Bean,et al.  A Genetic Algorithm for the Multiple-Choice Integer Program , 1997, Oper. Res..

[2]  D.A.G. Vieira,et al.  Treating constraints as objectives in multiobjective optimization problems using niched Pareto genetic algorithm , 2004, IEEE Transactions on Magnetics.

[3]  M. J. D. Powell,et al.  A fast algorithm for nonlinearly constrained optimization calculations , 1978 .

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

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

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

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

[8]  Patrick D. Surry,et al.  The COMOGA Method: Constrained Optimisation by Multi-Objective Genetic Algorithms , 1997 .

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

[10]  Keigo Watanabe,et al.  Evolutionary Optimization of Constrained Problems , 2004 .

[11]  Zbigniew Michalewicz,et al.  A Survey of Constraint Handling Techniques in Evolutionary Computation Methods , 1995 .

[12]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

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

[14]  Zbigniew Michalewicz,et al.  Adaptive evolutionary planner/navigator for mobile robots , 1997, IEEE Trans. Evol. Comput..

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

[16]  Douglas A. G. Vieira,et al.  Handling constraints as objectives in a multiobjective genetic based algorithm , 2002 .

[17]  Z. Michalewicz,et al.  Your brains and my beauty: parent matching for constrained optimisation , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

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

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

[20]  K. C. Seow,et al.  MULTIOBJECTIVE DESIGN OPTIMIZATION BY AN EVOLUTIONARY ALGORITHM , 2001 .

[21]  Zbigniew Michalewicz,et al.  Evolutionary Planner/Navigator: operator performance and self-tuning , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[22]  Z. Michalewicz,et al.  Genocop III: a co-evolutionary algorithm for numerical optimization problems with nonlinear constraints , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[23]  Tapabrata Ray,et al.  Infeasibility Driven Evolutionary Algorithm (IDEA) for Engineering Design Optimization , 2008, Australasian Conference on Artificial Intelligence.

[24]  P. Suganthan,et al.  Problem Definitions and Evaluation Criteria for the CEC 2010 Competition on Constrained Real- Parameter Optimization , 2010 .

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

[26]  Tapabrata Ray,et al.  Infeasibility Driven Evolutionary Algorithm for Constrained Optimization , 2009 .

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

[28]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[29]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..