An Improved Greedy Genetic Algorithm for Solving Travelling Salesman Problem

Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to overcome the above-mentioned limitations. This novel type of greedy genetic algorithm is based on the base point, which can generate good initial population, and combine with hybrid algorithms to get the optimal solution. The proposed algorithm is tested with the Traveling Salesman Problem (TSP), and the experimental results demonstrate that the proposed algorithm is a feasible and effective algorithm in solving complex optimization problems.

[1]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[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]  Feng Chun-song.  Ameliorative Genetic Algorithm of TSP , 2006 .

[4]  Prabhas Chongstitvatana,et al.  Parallel genetic algorithm with parameter adaptation , 2002, Inf. Process. Lett..

[5]  Ming Yang,et al.  An Improved Genetic Algorithm , 2010, 2010 First International Conference on Pervasive Computing, Signal Processing and Applications.

[6]  M. Batouche,et al.  A new quantum-inspired genetic algorithm for solving the travelling salesman problem , 2004, 2004 IEEE International Conference on Industrial Technology, 2004. IEEE ICIT '04..

[7]  Zhu Wen.  A Filled Function Method for the Traveling Salesman Problem , 2002 .

[8]  Ruizhen Gao,et al.  An Improved Genetic Algorithm Based on Fixed Point Theory for Function Optimization , 2009, 2009 International Conference on Computer Engineering and Technology.