Research on solving Traveling Salesman Problem based on virtual instrument technology and genetic-annealing algorithms

TSP (Travelling Salesman Problem) is a typical issue of combinatorial optimization problem in the domain of mathematics, which aims at finding the shortest pathway among the given cities, and visit each city only once. This essay introduces an efficient way to solve TSP based on virtual instrument technology, combining the genetic algorithm and annealing algorithm. Because it takes the advantage of global and local optimization of the two algorithms. Finally, this paper proves that using the genetic algorithm result as the initial condition of the annealing algorithm method is a better way to obtain the best pathway. The visible result displays and testes the validity of this method.

[1]  Aluizio F. R. Araújo,et al.  Multicast routing using genetic algorithm seen as a permutation problem , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

[2]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[3]  Ali Selamat,et al.  Analysis on route selection by mobile agents using genetic algorithm , 2003, SICE 2003 Annual Conference (IEEE Cat. No.03TH8734).

[4]  E. Gelenbe,et al.  Genetic Algorithms for Route Discovery , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[5]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[6]  Tomohiro Nakamura,et al.  Knowledge based genetic algorithm for dynamic route selection , 2000, KES'2000. Fourth International Conference on Knowledge-Based Intelligent Engineering Systems and Allied Technologies. Proceedings (Cat. No.00TH8516).

[7]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.