Crossover and mutation operators of genetic algorithms

Genetic algorithms (GA) are stimulated by population genetics and evolution at the population level where crossover and mutation comes from random variables. The problems of slow and premature convergence to suboptimal solution remain an existing struggle that GA is facing. Due to lower diversity in a population, it becomes challenging to locally exploit the solutions. In order to resolve these issues, the focus is now on reaching equilibrium between the explorative and exploitative features of GA. Therefore, the search process can be prompted to produce suitable GA solutions. This paper begins with an introduction, Section 2 describes the GA exploration and exploitation strategies to locate the optimum solutions. Section 3 and 4 present the lists of some prevalent mutation and crossover operators. This paper concludes that the key issue in developing a GA is to deliver a balance between explorative and exploitative features that complies with the combination of operators in order to produce exceptional performance as a GA as a whole.

[1]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .

[2]  Mohammed Azmi Al-Betar,et al.  Adaptive pair bonds in genetic algorithm: An application to real-parameter optimization , 2015, Appl. Math. Comput..

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

[4]  Changhe Li,et al.  A Directed Mutation Operator for Real Coded Genetic Algorithms , 2010, EvoApplications.

[5]  R. A. Rahman,et al.  Average Concept of Crossover Operator in Real Coded Genetic Algorithm , 2013 .

[6]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[7]  Christopher R. Houck,et al.  A Genetic Algorithm for Function Optimization: A Matlab Implementation , 2001 .

[8]  Peter Vamplew,et al.  Accelerating Real-Valued Genetic Algorithms Using Mutation-with-Momentum , 2005, Australian Conference on Artificial Intelligence.

[9]  Ping-Hung Tang,et al.  Adaptive directed mutation for real-coded genetic algorithms , 2013, Appl. Soft Comput..

[10]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[11]  Pupong Pongcharoen,et al.  Exploration of Genetic Parameters and Operators through Travelling Salesman Problem , 2007 .

[12]  Kalyanmoy Deb,et al.  A combined genetic adaptive search (GeneAS) for engineering design , 1996 .

[13]  M. Yamamura,et al.  Multi-parent recombination with simplex crossover in real coded genetic algorithms , 1999 .

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

[15]  Francisco Herrera,et al.  A taxonomy for the crossover operator for real‐coded genetic algorithms: An experimental study , 2003, Int. J. Intell. Syst..

[16]  Kusum Deep,et al.  A new mutation operator for real coded genetic algorithms , 2007, Appl. Math. Comput..

[17]  Heinz Mühlenbein,et al.  The parallel genetic algorithm as function optimizer , 1991, Parallel Comput..

[18]  Shigenobu Kobayashi,et al.  A Real-Coded Genetic Algorithm for Function Optimization Using the Unimodal Normal Distribution Crossover , 1999 .

[19]  Heinz Mühlenbein,et al.  Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.

[20]  Hajime Kita,et al.  A Comparison Study of Self-Adaptation in Evolution Strategies and Real-Coded Genetic Algorithms , 2001, Evolutionary Computation.

[21]  Sandeep Kumar,et al.  A Novel Hybrid Crossover based Artificial Bee Colony Algorithm for Optimization Problem , 2013, ArXiv.

[22]  Kalyanmoy Deb,et al.  A Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization , 2002, Evolutionary Computation.

[23]  Nikhil,et al.  Directed Mutation in Genetic Algorithms , 2022 .

[24]  Zhao Xinchao,et al.  Simulated annealing algorithm with adaptive neighborhood , 2011 .

[25]  Kalyanmoy Deb,et al.  On self-adaptive features in real-parameter evolutionary algorithms , 2001, IEEE Trans. Evol. Comput..

[26]  Charles E. Taylor.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Complex Adaptive Systems.John H. Holland , 1994 .

[27]  Alberto Moraglio,et al.  Geometric Crossovers for Multiway Graph Partitioning , 2007, Evolutionary Computation.

[28]  David E. Goldberg,et al.  The parameter-less genetic algorithm in practice , 2004, Inf. Sci..

[29]  Dana Vrajitoru,et al.  Hybrid real-coded mutation for genetic algorithms applied to graph layouts , 2005, GECCO '05.

[30]  Nicholas J. Radcliffe,et al.  Equivalence Class Analysis of Genetic Algorithms , 1991, Complex Syst..

[31]  Peter Vamplew,et al.  PoD Can Mutate: A Simple Dynamic Directed Mutation Approach for Genetic Algorithms , 2004 .

[32]  Cristian Munteanu,et al.  Improving Mutation Capabilities in a Real-Coded Genetic Algorithm , 1999, EvoWorkshops.

[33]  Shigenobu Kobayashi,et al.  Multi-Parental Extension of the Unimodal Normal Distribution Crossover for Real-Coded Genetic Algorithms , 2000 .

[34]  Sai-Ho Ling,et al.  An Improved Genetic Algorithm with Average-bound Crossover and Wavelet Mutation Operations , 2007, Soft Comput..

[35]  Wenyin Gong,et al.  Adaptive Ranking Mutation Operator Based Differential Evolution for Constrained Optimization , 2015, IEEE Transactions on Cybernetics.

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

[37]  Hans-Michael Voigt,et al.  Modal mutations in evolutionary algorithms , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[38]  Alain Delchambre,et al.  A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

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

[40]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[41]  J. Périaux,et al.  Multidisciplinary shape optimization in aerodynamics and electromagnetics using genetic algorithms , 1999 .

[42]  Qing Zhou,et al.  Directed variation in evolution strategies , 2003, IEEE Trans. Evol. Comput..

[43]  Zhang Rui,et al.  A hybrid of real coded genetic algorithm and artificial fish swarm algorithm for short-term optimal hydrothermal scheduling , 2014 .

[44]  Marjan Mernik,et al.  Exploration and exploitation in evolutionary algorithms: A survey , 2013, CSUR.

[45]  Ruhul A. Sarker,et al.  A new genetic algorithm for solving optimization problems , 2014, Eng. Appl. Artif. Intell..

[46]  Keith E. Mathias,et al.  Crossover Operator Biases: Exploiting the Population Distribution , 1997, ICGA.