Performance analyses over population seeding techniques of the permutation-coded genetic algorithm: An empirical study based on traveling salesman problems

A review on population seeding techniques for Permutation-coded Genetic Algorithm.Experiments are performed on large sized Traveling Salesman Problem instances.The experimentation analyses are carried out using ANOVA and DMRT statistical tools.Best performing population seeding techniques are identified w.r.t. assessment criteria. The genetic algorithm (GA) is a population based meta-heuristic global optimization technique for dealing with complex problems with very large search space. The population initialization is a crucial task in GA because it plays a vital role in the convergence speed, problem search space exploration and also the quality of the final optimal solution. Though the importance of deciding problem specific population initialization in GA is widely recognized, it is hardly addressed in the literature. In this paper, different population seeding techniques for permutation-coded genetic algorithm such as random, nearest neighbor (NN), gene bank (GB), sorted population (SP), selective initialization (SI) along with three newly proposed ordered distance vector based initialization techniques have been extensively studied. The ability of each population seeding technique has been examined in terms of a set of performance criteria such as computation time, convergence rate, error rate, average convergence, convergence diversity, nearest-neighbor ratio, average distinct solutions and distribution of individuals. One of the famous combinatorial hard problems of traveling salesman problem (TSP) is being chosen as the testbed and the experiments are performed on large sized benchmark TSP instances obtained from standard TSPLIB. The experimentation analyses are carried out using statistical tools to claim the unique performance characteristic of each population seeding techniques and best performing techniques are identified based on the assessment criteria defined and the nature of the application.

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

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

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

[4]  Kalyanmoy Deb,et al.  Domain-specific initial population strategy for compliant mechanisms using customized genetic algorithm , 2011 .

[5]  Ali R. Yildiz,et al.  A comparative study of population-based optimization algorithms for turning operations , 2012, Inf. Sci..

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

[7]  Ali R. Yildiz,et al.  A novel hybrid immune algorithm for global optimization in design and manufacturing , 2009 .

[8]  Ana Colubi,et al.  Computational Statistics and Data Analysis Fuzzy Data Treated as Functional Data: a One-way Anova Test Approach , 2022 .

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

[10]  Antonio Costa,et al.  A dual encoding-based meta-heuristic algorithm for solving a constrained hybrid flow shop scheduling problem , 2013, Comput. Ind. Eng..

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

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

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

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

[15]  Ali R. Yildiz,et al.  A new hybrid differential evolution algorithm for the selection of optimal machining parameters in milling operations , 2013, Appl. Soft Comput..

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

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

[18]  D. B. Duncan MULTIPLE RANGE AND MULTIPLE F TESTS , 1955 .

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

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

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

[22]  Ali R. Yildiz,et al.  Hybrid Taguchi-differential evolution algorithm for optimization of multi-pass turning operations , 2013, Appl. Soft Comput..

[23]  Shi Yang,et al.  A novel initialization method for solving Flexible Job-shop Scheduling Problem , 2009, 2009 International Conference on Computers & Industrial Engineering.

[24]  Kazuo Iwano,et al.  New TSP Construction Heuristics and Their Relationships to the 2-Opt , 1997, J. Heuristics.

[25]  Pascal Bouvry,et al.  Interval-based initialization method for permutation-based problems , 2010, IEEE Congress on Evolutionary Computation.

[26]  Ali R. Yildiz,et al.  Comparison of evolutionary-based optimization algorithms for structural design optimization , 2013, Eng. Appl. Artif. Intell..

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

[28]  Magdalene Marinaki,et al.  A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem , 2010, Expert Syst. Appl..

[29]  Ciprian Dobre,et al.  Near-Optimal Scheduling Based on Immune Algorithms in Distributed Environments , 2010, 2010 International Conference on Complex, Intelligent and Software Intensive Systems.

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

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

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

[33]  Ramachandran Baskaran,et al.  A new population seeding technique for permutation-coded Genetic Algorithm: Service transfer approach , 2014, J. Comput. Sci..

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

[35]  Ali R. Yildiz,et al.  Optimization of cutting parameters in multi-pass turning using artificial bee colony-based approach , 2013, Inf. Sci..

[36]  Ali R. Yildiz,et al.  A new hybrid artificial bee colony algorithm for robust optimal design and manufacturing , 2013, Appl. Soft Comput..

[37]  Chai-Yeoung Jung,et al.  The optimal solution of TSP using the new mixture initialization and sequential transformation method in genetic algorithm , 2006 .

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

[39]  Shyi-Ming Chen,et al.  Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques , 2011, Expert Syst. Appl..

[40]  Edmund K. Burke,et al.  Initialization Strategies and Diversity in Evolutionary Timetabling , 1998, Evolutionary Computation.

[41]  Chris D. Nugent,et al.  Genetic algorithm and pure random search for exosensor distribution optimisation , 2012, Int. J. Bio Inspired Comput..