Travelling Salesman Problem Optimization Using Hybrid Genetic Algorithm

[1]  Yong Wang,et al.  The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem , 2014, Comput. Ind. Eng..

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

[3]  Günther R. Raidl,et al.  Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem , 2008, 2008 Eighth International Conference on Hybrid Intelligent Systems.

[4]  Tingting Fu,et al.  Improved Real Coded Genetic Algorithm and Its Simulation , 2014, J. Softw..

[5]  I. Osman,et al.  A neural network algorithm for the traveling salesman problem with backhauls , 2003 .

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

[7]  Exnar Filip.  The Travelling Salesman Problem and its Application in Logistic Practice , 2011 .

[8]  H. L. Ong,et al.  A New Heuristic Algorithm for the Classical Symmetric Traveling Salesman Problem , 2007 .

[9]  S. Chatterjee,et al.  Genetic algorithms and traveling salesman problems , 1996 .

[10]  János Abonyi,et al.  A novel approach to solve multiple traveling salesmen problem by genetic algorithm , 2010 .

[11]  Q. H. Wu,et al.  Teaching Genetic Algorithm Using Matlab , 1999 .

[12]  Gilbert Laporte,et al.  A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem , 1996, INFORMS J. Comput..

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

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

[15]  Jaafar Abouchabaka,et al.  A Comparative Study of Adaptive Crossover Operators for Genetic Algorithms to Resolve the Traveling Salesman Problem , 2011, ArXiv.