An empirical comparison of two crossover operators in real-coded genetic algorithms for constrained numerical optimization problems

This paper presents an empirical analysis of two well-known crossover operators in real-coded genetic algorithms: Blend Crossover (BLX-a) and Simulated Binary Crossover (SBX), for constrained numerical optimization problems. The aim of the study is to analyze the ability of each operator to generate feasible solutions and also suggest suitable variation operator parameter values for such purpose. A performance measure is proposed to evaluate the capacity of each operator to find feasible offspring. A set of fourteen benchmark problems is used in the experiments. The results show that in both crossover operators the exploration ability must be enhanced so as to get better results.

[1]  Mitsuo Gen,et al.  A survey of penalty techniques in genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[2]  Kalyanmoy Deb,et al.  Real-coded Genetic Algorithms with Simulated Binary Crossover: Studies on Multimodal and Multiobjective Problems , 1995, Complex Syst..

[3]  Carlos A. Coello Coello,et al.  Constraint-handling in nature-inspired numerical optimization: Past, present and future , 2011, Swarm Evol. Comput..

[4]  Volker Nissen,et al.  An Introduction to Evolutionary Algorithms , 1995 .

[5]  Chih-Hao Lin,et al.  A rough penalty genetic algorithm for constrained optimization , 2013, Inf. Sci..

[6]  César Hervás-Martínez,et al.  Crossover Operator Effect in Function Optimization with Constraints , 2002, PPSN.

[7]  Ruhul A. Sarker,et al.  Search space reduction technique for constrained optimization with tiny feasible space , 2008, GECCO '08.

[8]  Zbigniew Michalewicz,et al.  Evolutionary algorithms for constrained engineering problems , 1996, Computers & Industrial Engineering.

[9]  John H. Holland,et al.  Outline for a Logical Theory of Adaptive Systems , 1962, JACM.

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

[11]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

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

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

[14]  Chang Wook Ahn,et al.  Advances in Evolutionary Algorithms: Theory, Design and Practice , 2006, Studies in Computational Intelligence.

[15]  Camelia-Mihaela Pintea.  Advances in Bio-inspired Computing for Combinatorial Optimization Problems , 2014, Intelligent Systems Reference Library.

[16]  César Hervás-Martínez,et al.  Crossover effect over penalty methods in function optimization with constraints , 2005, 2005 IEEE Congress on Evolutionary Computation.

[17]  Ruhul A. Sarker,et al.  A Comparative Study of Different Variants of Genetic Algorithms for Constrained Optimization , 2010, SEAL.

[18]  Keith L. Downing,et al.  Introduction to Evolutionary Algorithms , 2006 .

[19]  Ruhul A. Sarker,et al.  The Influence of the Number of Initial Feasible Solutions on the Performance of an Evolutionary Optimization Algorithm , 2012, SEAL.

[20]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms for Constrained Parameter Optimization Problems , 1996, Evolutionary Computation.

[21]  L. J. Eshelman,et al.  chapter Real-Coded Genetic Algorithms and Interval-Schemata , 1993 .

[22]  Jing J. Liang,et al.  Problem Deflnitions and Evaluation Criteria for the CEC 2006 Special Session on Constrained Real-Parameter Optimization , 2006 .

[23]  Ruhul A. Sarker,et al.  Improved evolutionary algorithms for solving constrained optimization problems with tiny feasible space , 2008, 2008 IEEE International Conference on Systems, Man and Cybernetics.

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

[25]  Sancho Salcedo-Sanz,et al.  A survey of repair methods used as constraint handling techniques in evolutionary algorithms , 2009, Comput. Sci. Rev..