A New Hybrid Algorithm for Solving Large Scale TSP
Han Zhi · Gongcheng shuxue xuebao · 2007
Genetic algorithm (GA) is an effective method for solving traveling salesman problem (TSP).However,GA becomes inefficient for large-scale TSP due to its shortcomings,such as long time expense and appearent efficiency decline during the final stage.By means of divided and conquer method,searching algorithm and Tabu algorithm,a new hybrid algorithm for TSP is formulated,which leads to better initial solutions and less computation load.Experiments demonstrate that the hybrid algorithm outperforms GA in both the quality of results and efficiency.Furthermore,the proposed hybrid algorithm is even more efficient in solving much large scale TSP.