New Mechanism of Combination Crossover Operators in Genetic Algorithm for Solving the Traveling Salesman Problem

Traveling salesman problem (TSP) is a well-known in computing field. There are many researches to improve the genetic algorithm for solving TSP. In this paper, we propose two new crossover operators and new mechanism of combination crossover operators in genetic algorithm for solving TSP. We experimented on TSP instances from TSP-Lib and compared the results of proposed algorithm with genetic algorithm(GA), which used MSCX. Experimental results show that, our proposed algorithm is better than the GA using MSCX on the min, mean cost values.

[1]  S. M. Abd-El-Moetty,et al.  Enhanced Traveling Salesman Problem Solving using Genetic Algorithm Technique with modified Sequential Constructive Crossover Operator , 2012 .

[2]  Jane Yung-jen Hsu,et al.  Dynamic vehicle routing using hybrid genetic algorithms , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[3]  Monica Sehrawat.  Modified Order Crossover (OX) Operator , 2011 .

[4]  Thomas Stützle,et al.  A Two-Phase Local Search for the Biobjective Traveling Salesman Problem , 2003, EMO.

[5]  Lawrence V. Snyder,et al.  A random-key genetic algorithm for the generalized traveling salesman problem , 2006, Eur. J. Oper. Res..

[6]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[7]  Kŵăƌd͘^ăůůăďŝ͕zžƶŷŝɛɛůͳ.  An Improved Genetic Algorithm to Solve the Traveling Salesman Problem , 2009 .

[8]  Nourolhoda Alemi Neissi,et al.  GLS Optimization Algorithm for Solving Travelling Salesman Problem , 2009, 2009 Second International Conference on Computer and Electrical Engineering.

[9]  Bernd Bischl,et al.  Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness , 2012, LION.

[10]  Mutsunori Yagiura,et al.  The use of dynamic programming in genetic algorithms for permutation problems , 1996 .

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

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

[13]  Sanghamitra Bandyopadhyay,et al.  New operators of genetic algorithms for traveling salesman problem , 2004, ICPR 2004.

[14]  J. Nazuno.  Haykin, Simon. Neural networks: A comprehensive foundation, Prentice Hall, Inc. Segunda Edición, 1999 , 2000 .

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

[16]  B. Freisleben,et al.  Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[17]  Simon Haykin,et al.  Neural Networks: A Comprehensive Foundation , 1998 .

[18]  Jean-Michel Renders,et al.  Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[19]  Sanghamitra Bandyopadhyay,et al.  New Genetic Operators for Solving TSP: Application to Microarray Gene Ordering , 2005, PReMI.

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

[21]  Bernd Freisleben,et al.  New Genetic Local Search Operators for the Traveling Salesman Problem , 1996, PPSN.

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

[23]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

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

[25]  Simon Haykin,et al.  Neural Networks: A Comprehensive Foundation (3rd Edition) , 2007 .