Title :
A Mixed Heuristic Algorithm for Traveling Salesman Problem
Author :
Yan, Yaowei ; Zhao, Xiaoheng ; Xu, Jia ; Xiao, Zhongwen
Author_Institution :
Dept. of Comput., Huazhong Univ. of Sci. & Technol., Wuhan, China
Abstract :
This paper introduces a mixed algorithm to solve the Traveling Salesman Problem (TSP). In the algorithm we mix the two heuristic algorithms to get a better performance and we validated the feasibility and efficiency of the mixed algorithm by simulating it with classic instances of TSP. According to the simulating results the algorithm can get the optimal solution and the performance is significantly improved.
Keywords :
transportation; travelling salesman problems; mixed heuristic algorithm; traveling salesman problem; Algorithm design and analysis; Approximation algorithms; Cities and towns; Classification algorithms; Convergence; Heuristic algorithms; Traveling salesman problems; TSP; driving navigation; traveling salesman sroblem;
Conference_Titel :
Multimedia Information Networking and Security (MINES), 2011 Third International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4577-1795-6
DOI :
10.1109/MINES.2011.44
