Randomized bias genetic algorithm to solve traveling salesman problem

Genetic algorithm is powerful technique to discover optimal for traveling salesman problem (TSP). Traveling salesman problem is well known NP-hard problem whose applications in many industries like logistic, transportation, manufacturing etc. Attempts has made to modify the genetic algorithm with parent selection in randomized bias (RBGA) manner to discover the optimal for traveling salesman problem. RBGA performance has tested against GA with respect to 30 benchmark problems for traveling salesman, which contain the suite of symmetric and non-symmetric problems. Numerical and graphical results show that RBGA have major advancement over GA for TSP in relation to find optimal and CPU running time. The TSP data set used for simulation is available at http://people.sc.fsu.edu/jburkardt/datasets/tsp/tsp.html.

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

[2]  Gerhard J. Woeginger,et al.  Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.

[3]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

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

[5]  Hui Li,et al.  A fast evolutionary algorithm for combinatorial optimization problems , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[6]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[7]  Gerhard Reinelt,et al.  Traveling salesman problem , 2012 .

[8]  Jian Li,et al.  Exact and Approximate Solutions of Source Localization Problems , 2008, IEEE Transactions on Signal Processing.

[9]  Juliane Jung,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[10]  Takahiro Watanabe,et al.  Circuit Design Optimization Using Genetic Algorithm with Parameterized Uniform Crossover , 2010, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

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

[12]  G. Rinaldi,et al.  Chapter 4 The traveling salesman problem , 1995 .

[13]  Kusum Deep,et al.  New Variations of Order Crossover for Travelling Salesman Problem , 2011, Int. J. Comb. Optim. Probl. Informatics.

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

[15]  Francesco Ricci,et al.  E-commerce and tourism , 2004, CACM.

[16]  Jie Zhang,et al.  An Improved Genetic Algorithm for TSP , 2007 .

[17]  電子情報通信学会.  IEICE transactions on fundamentals of electronics, communications and computer sciences , 1992 .

[18]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.