Crossover vs . Mutation : A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems

Since their first formulation, genetic algorithms (GA) have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GA is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test.

[1]  Eneko Osaba,et al.  Golden ball: a novel meta-heuristic to solve combinatorial optimization problems based on soccer concepts , 2014, Applied Intelligence.

[2]  Ning Xu,et al.  Genetic Algorithm and Graph Theory Based Matrix Factorization Method for Online Friend Recommendation , 2014, TheScientificWorldJournal.

[3]  Gen-Ke Yang,et al.  A Novel Algorithm Combining Finite State Method and Genetic Algorithm for Solving Crude Oil Scheduling Problem , 2014, TheScientificWorldJournal.

[4]  Bongju Jeong,et al.  An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints , 2014, TheScientificWorldJournal.

[5]  A. Halim Zaim,et al.  Genetic Algorithm Application in Optimization of Wireless Sensor Networks , 2014, TheScientificWorldJournal.

[6]  E. Osaba,et al.  A multi-crossover and adaptive island based population algorithm for solving routing problems , 2013, Journal of Zhejiang University SCIENCE C.

[7]  Eneko Osaba,et al.  Discussion related to "Wang, C.-H., & Lu, J.-Z. (2009). A hybrid genetic algorithm that optimizes capacitated vehicle routing problem. Expert Systems with Applications, 36(2), 2921-2936" , 2013, Expert Syst. Appl..

[8]  Zhaowei Sun,et al.  Research on Formation of Microsatellite Communication with Genetic Algorithm , 2013, TheScientificWorldJournal.

[9]  Zhonghua Li,et al.  Comparative Study of Artificial Bee Colony Algorithms with Heuristic Swap Operators for Traveling Salesman Problem , 2013, ICIC.

[10]  Emma Hart,et al.  Generating single and multiple cooperative heuristics for the one dimensional bin packing problem using a single node genetic programming island model , 2013, GECCO '13.

[11]  Ellips Masehian,et al.  Landscape analysis and efficient metaheuristics for solving the n-queens problem , 2013, Comput. Optim. Appl..

[12]  Eneko Osaba,et al.  Analysis of the suitability of using blind crossover operators in genetic algorithms for solving routing problems , 2013, 2013 IEEE 8th International Symposium on Applied Computational Intelligence and Informatics (SACI).

[13]  Walter D. Potter,et al.  A genetic algorithm to refine input data selection for air temperature prediction using artificial neural networks , 2013, Appl. Soft Comput..

[14]  Roberto Roberti,et al.  An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem , 2013, Oper. Res..

[15]  Li-Sheng Hu,et al.  A model induced max-min ant colony optimization for asymmetric traveling salesman problem , 2013, Appl. Soft Comput..

[16]  Simon Spoorendonk,et al.  A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem , 2013, Transp. Sci..

[17]  F. Pezzella,et al.  An adaptive genetic algorithm for large-size open stack problems , 2013 .

[18]  Xiaolei Ma,et al.  Vehicle Routing Problem , 2013 .

[19]  Tetsuyuki Takahama,et al.  New crossover operator based on semantic distance between subtrees in Genetic Programming , 2012, 2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[20]  Jean-François Cordeau,et al.  A parallel iterated tabu search heuristic for vehicle routing problems , 2012, Comput. Oper. Res..

[21]  Ben Paechter,et al.  A Hyper-Heuristic Classifier for One Dimensional Bin Packing Problems: Improving Classification Accuracy by Attribute Evolution , 2012, PPSN.

[22]  Zhiqiang Chen,et al.  An new crossover operator for real-coded genetic algorithm with selective breeding based on difference between individuals , 2012, 2012 8th International Conference on Natural Computation.

[23]  Michel Gendreau,et al.  A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems , 2012, Oper. Res..

[24]  I. Alberto,et al.  A mutation operator based on a Pareto ranking for multi-objective evolutionary algorithms , 2012, J. Heuristics.

[25]  Zorica Stanimirovic,et al.  A Genetic Algorithm Approach for the Capacitated Single Allocation P-Hub Median Problem , 2012, Comput. Informatics.

[26]  Juan R. Velasco,et al.  Optimisation of control parameters for genetic algorithms to test computer networks under realistic traffic loads , 2011, Appl. Soft Comput..

[27]  Krzysztof Fleszar,et al.  Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem , 2011, Eur. J. Oper. Res..

[28]  Novruz Allahverdi,et al.  Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms , 2011, Expert Syst. Appl..

[29]  M.H. Moradi,et al.  A combination of Genetic Algorithm and Particle Swarm Optimization for optimal DG location and sizing in distribution systems , 2010, 2010 Conference Proceedings IPEC.

[30]  Wout Dullaert,et al.  A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows , 2010, Comput. Oper. Res..

[31]  M. Golub,et al.  Comparison of Heuristic Algorithms for the N-Queen Problem , 2007, 2007 29th International Conference on Information Technology Interfaces.

[32]  Yuichi Nagata,et al.  Edge Assembly Crossover for the Capacitated Vehicle Routing Problem , 2007, EvoCOP.

[33]  Sanghamitra Bandyopadhyay,et al.  New operators of genetic algorithms for traveling salesman problem , 2004, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

[34]  Parag C. Pendharkar,et al.  An empirical study of impact of crossover operators on the performance of non-binary genetic algorithm based neural approaches for classification , 2004, Comput. Oper. Res..

[35]  Jean Berger,et al.  A new hybrid genetic algorithm for the capacitated vehicle routing problem , 2003, J. Oper. Res. Soc..

[36]  Imed Kacem,et al.  Genetic algorithm for the flexible job-shop scheduling problem , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[37]  Kwong-Sak Leung,et al.  A novel approach in parameter adaptation and diversity maintenance for genetic algorithms , 2003, Soft Comput..

[38]  Russell C. Eberhart,et al.  Swarm intelligence for permutation optimization: a case study of n-queens problem , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[39]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

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

[41]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..

[42]  Penousal Machado,et al.  GVR: A New Genetic Representation for the Vehicle Routing Problem , 2002, AICS.

[43]  Erick Cantú-Paz,et al.  Efficient and Accurate Parallel Genetic Algorithms , 2000, Genetic Algorithms and Evolutionary Computation.

[44]  Leonardo Bottaci,et al.  Efficiency of mutation operators and selective mutation strategies: an empirical study , 1999, Softw. Test. Verification Reliab..

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

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

[47]  Enrique Alba,et al.  A survey of parallel distributed genetic algorithms , 1999, Complex..

[48]  Russell C. Eberhart,et al.  Comparison between Genetic Algorithms and Particle Swarm Optimization , 1998, Evolutionary Programming.

[49]  Peter Nordin,et al.  The Effect of Extensive Use of the Mutation Operator on Generalization in Genetic Programming Using Sparse Data Sets , 1996, PPSN.

[50]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

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

[52]  Zekeriya Aliyazicioglu,et al.  Linear Congruence Equations for the Solutions of the N-Queens Problem , 1992, Inf. Process. Lett..

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

[54]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[55]  Kenneth A. De Jong,et al.  An Analysis of the Interacting Roles of Population Size and Crossover in Genetic Algorithms , 1990, PPSN.

[56]  J. W. Atmar,et al.  Comparing genetic operators with gaussian mutations in simulated evolutionary processes using linear systems , 1990, Biological Cybernetics.

[57]  D. Fogel.  An evolutionary approach to the traveling salesman problem , 1988, Biological Cybernetics.

[58]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

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

[60]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[61]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[62]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[63]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[64]  Eneko Osaba,et al.  A Proposal of Good Practice in the Formulation and Comparison of Meta-heuristics for Solving Routing Problems , 2014, SOCO-CISIS-ICEUTE.

[65]  Brett Stevens,et al.  A survey of known results and research areas for n-queens , 2009, Discret. Math..

[66]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

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

[68]  Erick Cantú-Paz,et al.  A Survey of Parallel Genetic Algorithms , 2000 .

[69]  A. E. Eiben,et al.  On Evolutionary Exploration and Exploitation , 1998, Fundam. Informaticae.

[70]  Marco Tomassini,et al.  a Survey of Genetic Algorithms , 1995 .

[71]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[72]  David B. Fogel,et al.  An introduction to simulated evolutionary optimization , 1994, IEEE Trans. Neural Networks.

[73]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

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

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

[76]  Ronald L. Graham,et al.  On the History of the Minimum Spanning Tree Problem , 1985, Annals of the History of Computing.

[77]  Subhash C. Narula,et al.  Degree-constrained minimum spanning tree , 1980, Comput. Oper. Res..

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