A self-organizing migrating genetic algorithm for constrained optimization

In this paper, a self-organizing migrating genetic algorithm for constrained optimization, called C-SOMGA is presented. This algorithm is based on the features of genetic algorithm (GA) and self-organizing migrating algorithm (SOMA). The aim of this work is to use a penalty free constraint handling selection with our earlier developed algorithm SOMGA (self-organizing migrating genetic algorithm) for unconstrained optimization. C-SOMGA is not only easy to implement but can also provide feasible and better solutions in less number of function evaluations. To evaluate the robustness of the proposed algorithm, its performance is reported on a set of ten constrained test problems taken from literature. To validate our claims, it is compared with C-GA (constrained GA), C-SOMA (constrained SOMA) and previously quoted results for these problems.

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

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

[3]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[4]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[5]  Harvey M. Salkin,et al.  Integer Programming , 2019, Engineering Optimization Theory and Practice.

[6]  Zbigniew Michalewicz,et al.  Genetic AlgorithmsNumerical Optimizationand Constraints , 1995, ICGA.

[7]  H Myung,et al.  Hybrid evolutionary programming for heavily constrained problems. , 1996, Bio Systems.

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

[9]  A. V. Levy,et al.  The Tunneling Algorithm for the Global Minimization of Functions , 1985 .

[10]  Carlos A. Coello Coello,et al.  Constraint-handling in genetic algorithms through the use of dominance-based tournament selection , 2002, Adv. Eng. Informatics.

[11]  Millie Pant,et al.  GENETIC ALGORITHMS FOR GLOBAL OPTMIZATION AND THEIR APPLICATIONS , 2003 .

[12]  KalyanmoyDebandSamirAgrawal KanpurGeneticAlgorithmsLaboratory,et al.  A Niched-Penalty Approach for Constraint Handling in Genetic Algorithms , 2002 .

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

[14]  Tapabrata Ray,et al.  A socio-behavioural simulation model for engineering design optimization , 2002 .

[15]  Anthony Chen,et al.  Constraint handling in genetic algorithms using a gradient-based repair method , 2006, Comput. Oper. Res..

[16]  Kusum Deep,et al.  A new hybrid Self Organizing Migrating Genetic Algorithm for function optimization , 2007, 2007 IEEE Congress on Evolutionary Computation.

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

[18]  Rick Hesse.  A Heuristic Search Procedure for Estimating a Global Solution of Nonconvex Programming Problems , 1973, Oper. Res..

[19]  Hyun Myung,et al.  A Two-Phase Evolutionary Programming for General Constrained Optimization Problem , 1996, Evolutionary Programming.

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

[21]  Andrzej Osyczka,et al.  Evolutionary Algorithms for Single and Multicriteria Design Optimization , 2001 .

[22]  Lawrence Davis,et al.  Using a genetic algorithm to optimize problems with feasibility constraints , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.