A Mixed Heuristic Algorithm for Traveling Salesman Problem
Yaowei Yan, Xiaoheng Zhao, Jia Xu, Zhongwen Xiao · 2011
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.