Choosing Mutation and Crossover Ratios for Genetic Algorithms - A Review with a New Dynamic Approach

Genetic algorithm (GA) is an artificial intelligence search method that uses the process of evolution and natural selection theory and is under the umbrella of evolutionary computing algorithm. It is an efficient tool for solving optimization problems. Integration among (GA) parameters is vital for successful (GA) search. Such parameters include mutation and crossover rates in addition to population that are important issues in (GA). However, each operator of GA has a special and different influence. The impact of these factors is influenced by their probabilities; it is difficult to predefine specific ratios for each parameter, particularly, mutation and crossover operators. This paper reviews various methods for choosing mutation and crossover ratios in GAs. Next, we define new deterministic control approaches for crossover and mutation rates, namely Dynamic Decreasing of high mutation ratio/dynamic increasing of low crossover ratio (DHM/ILC), and Dynamic Increasing of Low Mutation/Dynamic Decreasing of High Crossover (ILM/DHC). The dynamic nature of the proposed methods allows the ratios of both crossover and mutation operators to be changed linearly during the search progress, where (DHM/ILC) starts with 100% ratio for mutations, and 0% for crossovers. Both mutation and crossover ratios start to decrease and increase, respectively. By the end of the search process, the ratios will be 0% for mutations and 100% for crossovers. (ILM/DHC) worked the same but the other way around. The proposed approach was compared with two parameters tuning methods (predefined), namely fifty-fifty crossover/mutation ratios, and the most common approach that uses static ratios such as (0.03) mutation rates and (0.9) crossover rates. The experiments were conducted on ten Traveling Salesman Problems (TSP). The experiments showed the effectiveness of the proposed (DHM/ILC) when dealing with small population size, while the proposed (ILM/DHC) was found to be more effective when using large population size. In fact, both proposed dynamic methods outperformed the predefined methods compared in most cases tested.

[1]  V. Snášel,et al.  Modeling Permutations for Genetic Algorithms , 2009, 2009 International Conference of Soft Computing and Pattern Recognition.

[2]  Mohammad Hamdan A Heterogeneous Framework for the Global Parallelisation of Genetic Algorithms , 2008, Int. Arab J. Inf. Technol..

[3]  Jessica Andrea Carballido,et al.  On Stopping Criteria for Genetic Algorithms , 2004, SBIA.

[4]  Oluwarotimi Williams Samuel,et al.  A Genetic-Neuro-Fuzzy inferential model for diagnosis of tuberculosis , 2017 .

[5]  Heinz Mühlenbein,et al.  Optimal Interaction of Mutation and Crossover in the Breeder Genetic Algorithm , 1993, ICGA.

[6]  John Geraghty,et al.  Genetic Algorithm Performance with Different Selection Strategies in Solving TSP , 2011 .

[7]  Z H Ahmed,et al.  GENETIC ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM USING SEQUENTIAL CONSTRUCTIVE CROSSOVER , 2010 .

[8]  Kenneth A. De Jong,et al.  A formal analysis of the role of multi-point crossover in genetic algorithms , 1992, Annals of Mathematics and Artificial Intelligence.

[9]  P.W.M. Tsang,et al.  A genetic algorithm for projective invariant object recognition , 1996, Proceedings of Digital Processing Applications (TENCON '96).

[10]  Nitasha Soni,et al.  Study of Various Mutation Operators in Genetic Algorithms , 2014 .

[11]  V. B. Surya Prasath,et al.  A HybridWavelet-Shearlet Approach to Robust Digital ImageWatermarking , 2017, Informatica.

[12]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[13]  Baoye Song,et al.  Fast Genetic Algorithms Used for PID Parameter Optimization , 2007, 2007 IEEE International Conference on Automation and Logistics.

[14]  G. Laporte The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[15]  Esra'a Alkafaween,et al.  Novel Methods for Enhancing the Performance of Genetic Algorithms , 2018, ArXiv.

[16]  Hany H. Ammar,et al.  Fingerprint registration using genetic algorithms , 2000, Proceedings 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology.

[17]  Yilmaz Kaya,et al.  A Novel Crossover Operator for Genetic Algorithms: Ring Crossover , 2011, ArXiv.

[18]  Pedro A. Diaz-Gomez,et al.  Initial Population for Genetic Algorithms: A Metric Approach , 2007, GEM.

[19]  Nelson F. F. Ebecken,et al.  Genetic Optimization of Artificial Neural Networks to Forecast Virioplankton Abundance from Cytometric Data , 2013 .

[20]  Rakesh Kumar Novel Encoding Scheme in Genetic Algorithms for Better Fitness , 2012 .

[21]  Enrique Alexandre,et al.  Feature Selection for Sound Classification in Hearing Aids Through Restricted Search Driven by Genetic Algorithms , 2007, IEEE Transactions on Audio, Speech, and Language Processing.

[22]  Jianjuan Liu Application of Fuzzy Neural Networks Based on Genetic Algorithms in Integrated Navigation System , 2009, 2009 Second International Conference on Intelligent Computation Technology and Automation.

[23]  Dieter Hendricks,et al.  An unsupervised parallel genetic cluster algorithm for graphics processing units , 2014, ArXiv.

[24]  N. Davey,et al.  An adaptive RBF network optimised using a genetic algorithm applied to rainfall forecasting , 2004, IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004..

[25]  Miroslaw Malek,et al.  Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem , 1990 .

[26]  A. Sorsa,et al.  Real-coded genetic algorithms and nonlinear parameter identification , 2008, 2008 4th International IEEE Conference Intelligent Systems.

[27]  Ahmad B A Hassanat,et al.  Two-point-based binary search trees for accelerating big data classification using KNN , 2018, PloS one.

[28]  Julius Zilinskas,et al.  Optimal Placement of Piles in Real Grillages: Experimental Comparison of Optimization Algorithms , 2011, Inf. Technol. Control..

[29]  Bo Meng,et al.  Research On Dynamics in Group Decision Support Systems Based On Multi-Objective Genetic Algorithms , 2006, 2006 International Conference on Service Systems and Service Management.

[30]  Jun Zhang,et al.  Comparison of Performance between Different Selection Strategies on Simple Genetic Algorithms , 2005, International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06).

[31]  Darrell Whitley,et al.  A genetic algorithm tutorial , 1994, Statistics and Computing.

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

[33]  Wael Mustafa Optimization of Production Systems Using Genetic Algorithms , 2003, Int. J. Comput. Intell. Appl..

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

[35]  Bernd Freisleben,et al.  A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[36]  David R. Munroe Genetic programming: the ratio of crossover to mutation as a function of time , 2004 .

[37]  I. Bradaric,et al.  Using genetic algorithms for radar waveform selection , 2008, 2008 IEEE Radar Conference.

[38]  Kalyanmoy Deb,et al.  Understanding Interactions among Genetic Algorithm Parameters , 1998, FOGA.

[39]  Olympia Roeva,et al.  Influence of the population size on the genetic algorithm performance in case of cultivation process modelling , 2013, 2013 Federated Conference on Computer Science and Information Systems.

[40]  Lawrence Davis,et al.  Adapting Operator Probabilities in Genetic Algorithms , 1989, ICGA.

[41]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[42]  Ahmad B. A. Hassanat,et al.  Furthest-Pair-Based Decision Trees: Experimental Results on Big Data Classification , 2018, Inf..

[43]  H. P. Stehouwer,et al.  Neural Networks and the Travelling Salesman Problem , 1993 .

[44]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[45]  Jiang Ai-ping,et al.  Methods for optimizing weights of wavelet neural network based on adaptive annealing genetic algorithm , 2009, 2009 16th International Conference on Industrial Engineering and Engineering Management.

[46]  Hossam Faris,et al.  An Improved Genetic Algorithm with a New Initialization Mechanism Based on Regression Techniques , 2018, Inf..

[47]  Andrius Usinskas,et al.  A SURVEY OF GENETIC ALGORITHMS APPLICATIONS FOR IMAGE ENHANCEMENT AND SEGMENTATION , 2007 .

[48]  R. O. Oladele,et al.  Genetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem , 2013 .

[49]  Yan Wu,et al.  Dynamic Crossover and Mutation Genetic Algorithm Based on Expansion Sampling , 2009, AICI.

[50]  Xiaohui Zhang,et al.  Measurement of the Optical Properties Using Genetic Algorithm Optimized Neural Networks , 2011, 2011 Symposium on Photonics and Optoelectronics (SOPO).

[51]  Hadi Aliakbarpour,et al.  On Optimal Multi-Sensor Network Configuration for 3D Registration , 2015, J. Sens. Actuator Networks.

[52]  Ali Belmehdi,et al.  Genetic Algorithms in Speech Recognition Systems , 2012 .

[53]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[54]  Hao Wang,et al.  Introduction to Genetic Algorithms in Electromagnetics , 1995 .

[55]  Subhagata Chattopadhyay,et al.  Genetic-neuro-fuzzy system for grading depression , 2018 .

[56]  Tzung-Pei Hong,et al.  Evolution of Appropriate Crossover and Mutation Operators in a Genetic Process , 2001, Applied Intelligence.

[57]  Ming Qi,et al.  Application of Elman neural network based on improved niche adaptive genetic algorithm , 2011, 2011 2nd International Conference on Intelligent Control and Information Processing.

[58]  Chen Lin,et al.  An Adaptive Genetic Algorithm Based on Population Diversity Strategy , 2009, 2009 Third International Conference on Genetic and Evolutionary Computing.

[59]  Shengxiang Yang,et al.  Multi-population methods with adaptive mutation for multi-modal optimization problems , 2013, SOCO 2013.

[60]  Ahmad B. A. Hassanat,et al.  Furthest-Pair-Based Binary Search Tree for Speeding Big Data Classification Using K-Nearest Neighbors , 2018, Big Data.

[61]  Ahmad B. A. Hassanat,et al.  Norm-Based Binary Search Trees for Speeding Up KNN Big Data Classification , 2018, Comput..

[62]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[63]  Ahmad B. A. Hassanat,et al.  Effects of Distance Measure Choice on K-Nearest Neighbor Classifier Performance: A Review , 2019, Big Data.

[64]  Sam Kwong,et al.  Genetic algorithms: concepts and applications [in engineering design] , 1996, IEEE Trans. Ind. Electron..

[65]  Salim Chikhi,et al.  Comparison of genetic algorithm and quantum genetic algorithm , 2012, Int. Arab J. Inf. Technol..

[66]  W. Banzhaf,et al.  The “molecular” traveling salesman , 1990, Biological Cybernetics.

[67]  Kai Guo,et al.  Application research of improved genetic algorithm based on machine learning in production scheduling , 2019, Neural Computing and Applications.

[68]  Tzung-Pei Hong,et al.  A dynamic mutation genetic algorithm , 1996, 1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929).

[69]  Ahmed M. Mohammed Optimal Routing In Ad-Hoc Network Using Genetic Algorithm , 2012 .

[70]  David E. Goldberg,et al.  Bayesian Optimization Algorithm, Population Sizing, and Time to Convergence , 2000, GECCO.

[71]  Hitesh Gupta,et al.  Speech Feature Extraction and Recognition Using Genetic Algorithm , 2014 .

[72]  M. Lynch Evolution of the mutation rate. , 2010, Trends in genetics : TIG.

[73]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[74]  Youssef Harrath,et al.  Permutation rules and genetic algorithm to solve the traveling salesman problem , 2019, Arab Journal of Basic and Applied Sciences.

[75]  Jaafar Abouchabaka,et al.  Analyzing the Performance of Mutation Operators to Solve the Travelling Salesman Problem , 2012, ArXiv.

[76]  Ali M. S. Zalzala,et al.  Hybridisation of neural networks and genetic algorithms for time-optimal control , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[77]  Lalit M. Patnaik,et al.  Genetic algorithms: a survey , 1994, Computer.

[78]  D. Fogel Evolutionary algorithms in theory and practice , 1997, Complex..

[79]  Fatma A. Karkory,et al.  Implementation of Heuristics for Solving Travelling Salesman Problem Using Nearest Neighbour and Minimum Spanning Tree Algorithms , 2013 .

[80]  Wen-Jye Shyr,et al.  Parameters Determination for Optimum Design by Evolutionary Algorithm , 2010 .

[81]  Richard Szeliski,et al.  An Analysis of the Elastic Net Approach to the Traveling Salesman Problem , 1989, Neural Computation.

[82]  Sam Kwong,et al.  Genetic algorithms: concepts and applications [in engineering design] , 1996, IEEE Trans. Ind. Electron..

[83]  Hossam Faris,et al.  On Computerizing the Ancient Game of Ṭāb , 2018, Int. J. Gaming Comput. Mediat. Simulations.

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

[85]  Terence C. Fogarty,et al.  Comparison of steady state and generational genetic algorithms for use in nonstationary environments , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[86]  Wong Ka Yan,et al.  Positioning Weather Systems from Remote Sensing Data Using Genetic Algorithms , 2008 .

[87]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[88]  Jean-Michel Renders,et al.  Hybrid methods using genetic algorithms for global optimization , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[89]  T. Rauschenbach,et al.  Modeling, Control and Optimization of Water Systems , 2016 .

[90]  M. Seetha,et al.  EELAM: Energy efficient lifetime aware multicast route selection for mobile ad hoc networks , 2019, Applied Computing and Informatics.

[91]  Sam Kwong,et al.  Genetic Algorithms : Concepts and Designs , 1998 .

[92]  Yanchun Liang,et al.  Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..

[93]  Krzysztof Krawiec,et al.  Generative learning of visual concepts using multiobjective genetic programming , 2007, Pattern Recognit. Lett..

[94]  Alka Singh,et al.  Exploring Travelling Salesman Problem using Genetic Algorithm , 2014 .

[95]  Jean-Yves Potvin,et al.  Genetic Algorithms for the Traveling Salesman Problem , 2005 .

[96]  Xiao Bo,et al.  BP network model optimized by adaptive genetic algorithms and the application on quality evaluation for class teaching , 2010, 2010 2nd International Conference on Future Computer and Communication.

[97]  Yo-Ping Huang,et al.  Genetic algorithms in the identification of fuzzy compensation system , 1996, 1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929).

[98]  Stanley Phillips Gotshall,et al.  Optimal Population Size and the Genetic Algorithm , 2002 .

[99]  Yong Ming Wang,et al.  Cost-Optimization Problem with a Soft Time Window Based on an Improved Fuzzy Genetic Algorithm for Fresh Food Distribution , 2018 .

[100]  Ahmad B. A. Hassanat,et al.  On enhancing genetic algorithms using new crossovers , 2017, Int. J. Comput. Appl. Technol..

[101]  David Beasley,et al.  An overview of genetic algorithms: Part 1 , 1993 .

[102]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[103]  Tai-hoon Kim,et al.  Application of Genetic Algorithm in Software Testing , 2009 .

[104]  Zbigniew Michalewicz,et al.  Parameter Control in Evolutionary Algorithms , 2007, Parameter Setting in Evolutionary Algorithms.

[105]  A. Hassanat,et al.  1 Enhancing Genetic Algorithms using Multi Mutations : Experimental Results on the Travelling Salesman Problem , 2016 .

[106]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[107]  Adam Lipowski,et al.  Roulette-wheel selection via stochastic acceptance , 2011, ArXiv.

[108]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[109]  V. K. Koumousis,et al.  A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance , 2006, IEEE Transactions on Evolutionary Computation.

[110]  Bull,et al.  An Overview of Genetic Algorithms: Part 2, Research Topics , 1993 .

[111]  Alan Piszcz,et al.  Genetic programming: optimal population sizes for varying complexity problems , 2006, GECCO '06.

[112]  Deepti Mehrotra,et al.  Comparative review of selection techniques in genetic algorithm , 2015, 2015 International Conference on Futuristic Trends on Computational Analysis and Knowledge Management (ABLAZE).