An Improved Genetic Algorithm with a New Initialization Mechanism Based on Regression Techniques

Genetic algorithm (GA) is one of the well-known techniques from the area of evolutionary computation that plays a significant role in obtaining meaningful solutions to complex problems with large search space. GAs involve three fundamental operations after creating an initial population, namely selection, crossover, and mutation. The first task in GAs is to create an appropriate initial population. Traditionally GAs with randomly selected population is widely used as it is simple and efficient; however, the generated population may contain poor fitness. Low quality or poor fitness of individuals may lead to take long time to converge to an optimal (or near-optimal) solution. Therefore, the fitness or quality of initial population of individuals plays a significant role in determining an optimal or near-optimal solution. In this work, we propose a new method for the initial population seeding based on linear regression analysis of the problem tackled by the GA; in this paper, the traveling salesman problem (TSP). The proposed Regression-based technique divides a given large scale TSP problem into smaller sub-problems. This is done using the regression line and its perpendicular line, which allow for clustering the cities into four sub-problems repeatedly, the location of each city determines which category/cluster the city belongs to, the algorithm works repeatedly until the size of the subproblem becomes very small, four cities or less for instance, these cities are more likely neighboring each other, so connecting them to each other creates a somehow good solution to start with, this solution is mutated several times to form the initial population. We analyze the performance of the GA when using traditional population seeding techniques, such as the random and nearest neighbors, along with the proposed regression-based technique. The experiments are carried out using some of the well-known TSP instances obtained from the TSPLIB, which is the standard library for TSP problems. Quantitative analysis is carried out using the statistical test tools: analysis of variance (ANOVA), Duncan multiple range test (DMRT), and least significant difference (LSD). The experimental results show that the performance of the GA that uses the proposed regression-based technique for population seeding outperforms other GAs that uses traditional population seeding techniques such as the random and the nearest neighbor based techniques in terms of error rate, and average convergence.

[1]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[2]  Fang Miao,et al.  Genetic Algorithm with an Improved Initial Population Technique for Automatic Clustering of Low-Dimensional Data , 2018, Inf..

[3]  Wayne Pullan,et al.  Adapting the genetic algorithm to the travelling salesman problem , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

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

[5]  K. Miettinen,et al.  Quasi-random initial population for genetic algorithms , 2004 .

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

[7]  Surya Prakash Tripathi,et al.  A Review on the Interpretability-Accuracy Trade-Off in Evolutionary Multi-Objective Fuzzy Systems (EMOFS) , 2012, Inf..

[8]  P. V. Paul,et al.  Performance Analyses on Population Seeding Techniques for Genetic Algorithms , 2013 .

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

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

[11]  Shahryar Rahnamayan,et al.  A novel population initialization method for accelerating evolutionary algorithms , 2007, Comput. Math. Appl..

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

[13]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[14]  K. Katayama,et al.  The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem , 2000 .

[15]  Liangsheng Qu,et al.  A Synergetic Approach to Genetic Algorithms for Solving Traveling Salesman Problem , 1999, Inf. Sci..

[16]  Sandeep Kumar Hegde,et al.  Literature Survey On Travelling Salesman Problem Using Genetic Algorithms , 2015 .

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

[18]  Deepti Gupta,et al.  An Overview of methods maintaining Diversity in Genetic Algorithms , 2012 .

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

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

[21]  P. Victer Paul,et al.  Performance analyses over population seeding techniques of the permutation-coded genetic algorithm: An empirical study based on traveling salesman problems , 2015, Appl. Soft Comput..

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

[23]  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).

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

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

[26]  Angus M. Brown A new software for carrying out one-way ANOVA post hoc tests , 2005, Comput. Methods Programs Biomed..

[27]  Eneko Osaba,et al.  Comparison of a memetic algorithm and a tabu search algorithm for the traveling salesman problem , 2012, 2012 Federated Conference on Computer Science and Information Systems (FedCSIS).

[28]  Gunar E. Liepins,et al.  A New Approach on the Traveling Salesman Problem by Genetic Algorithms , 1993, ICGA.

[29]  D. Kaur,et al.  Performance enhancement in solving Traveling Salesman Problem using hybrid genetic algorithm , 2008, NAFIPS 2008 - 2008 Annual Meeting of the North American Fuzzy Information Processing Society.

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

[31]  Sanghamitra Bandyopadhyay,et al.  Genetic operators for combinatorial optimization in TSP and microarray gene ordering , 2007, Applied Intelligence.

[32]  Xiao-Ping Liao,et al.  An orthogonal genetic algorithm with total flowtime minimization for the no-wait flow shop problem , 2009, 2009 International Conference on Machine Learning and Cybernetics.

[33]  Jing Lu,et al.  Optimization of China Crude Oil Transportation Network with Genetic Ant Colony Algorithm , 2015, Inf..

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

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

[36]  Murali Bhaskaran,et al.  Improving the Performance of Genetic Algorithm by Reducing the Population Size , 2013 .

[37]  Thomas Bäck,et al.  An Overview of Evolutionary Algorithms for Parameter Optimization , 1993, Evolutionary Computation.

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

[39]  Leandro dos Santos Coelho,et al.  Tuning of PID controller based on a multiobjective genetic algorithm applied to a robotic manipulator , 2012, Expert Syst. Appl..

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

[41]  Amin Mohebifar,et al.  New binary representation in genetic algorithms for solving TSP by mapping permutations to a list of ordered numbers , 2006 .

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

[43]  Yingwu Chen,et al.  A knowledge-based technique for initializing a genetic algorithm , 2016, J. Intell. Fuzzy Syst..

[44]  G. Andal Jayalakshmi,et al.  A Hybrid Genetic Algorithm - A New Approach to Solve Traveling Salesman Problem , 2001, Int. J. Comput. Eng. Sci..

[45]  S. N. Sivanandam,et al.  Introduction to genetic algorithms , 2007 .

[46]  O. Yugay,et al.  Hybrid Genetic Algorithm for Solving Traveling Salesman Problem with Sorted Population , 2008, 2008 Third International Conference on Convergence and Hybrid Information Technology.

[47]  Rajendra Akerkar,et al.  Genetic Algorithms and Evolutionary Computing , 2016 .

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

[49]  Yulan Hu,et al.  Parallel Search Strategies for TSPs Using a Greedy Genetic Algorithm , 2007, Third International Conference on Natural Computation (ICNC 2007).

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

[51]  Eneko Osaba,et al.  On the influence of using initialization functions on genetic algorithms solving combinatorial optimization problems: A first study on the TSP , 2014, 2014 IEEE Conference on Evolving and Adaptive Intelligent Systems (EAIS).

[52]  Jie Zhu,et al.  A genetic algorithm for finding a path subject to two constraints , 2013, Appl. Soft Comput..

[53]  Longhui Gang,et al.  Improved Genetic Algorithm Optimization for Forward Vehicle Detection Problems , 2015, Inf..

[54]  Xiang Li,et al.  Initialization strategies to enhancing the performance of genetic algorithms for the p-median problem , 2011, Comput. Ind. Eng..

[55]  Kaisa Miettinen,et al.  On initial populations of a genetic algorithm for continuous optimization problems , 2007, J. Glob. Optim..

[56]  David Stuart Robertson,et al.  Evolution in ecological agent systems , 2011, Int. J. Bio Inspired Comput..

[57]  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).

[58]  Juliet Popper Shaffer,et al.  A semi-Bayesian study of Duncan's Bayesian multiple comparison procedure , 1999 .

[59]  P. Dhavachelvan,et al.  A novel population initialization technique for Genetic Algorithm , 2013, 2013 International Conference on Circuits, Power and Computing Technologies (ICCPCT).

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

[61]  Yang Liu,et al.  An Improved Genetic Algorithm with Initial Population Strategy for Symmetric TSP , 2015 .

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

[63]  Jian Ma,et al.  A hybrid grouping genetic algorithm for reviewer group construction problem , 2011, Expert Syst. Appl..

[64]  Rong Yang,et al.  Solving large travelling salesman problems with small populations , 1997 .

[65]  Daniel Pedersen,et al.  Coarse-grained parallel genetic algorithms: Three implementations and their analysis , 1998 .

[66]  Sushil J. Louis,et al.  Interactive genetic algorithms for the traveling salesman problem , 1999 .

[67]  Gigliola Vaglini,et al.  An Interval-Valued Approach to Business Process Simulation Based on Genetic Algorithms and the BPMN , 2014, Inf..

[68]  Cheng-Fa Tsai,et al.  A new approach for solving large traveling salesman problem using evolutionary ant rules , 2002, Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290).