%0 Journal Article
	%A S. B. Liu and  K. M. Ng and  H. L. Ong
	%D 2007
	%J International Journal of Industrial and Manufacturing Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 1, 2007
	%T  A New Heuristic Algorithm for the Classical Symmetric Traveling Salesman Problem 
	%U https://publications.waset.org/pdf/13266
	%V 1
	%X This paper presents a new heuristic algorithm for the classical symmetric traveling salesman problem (TSP). The idea of the algorithm is to cut a TSP tour into overlapped blocks and then each block is improved separately. It is conjectured that the chance of improving a good solution by moving a node to a position far away from its original one is small. By doing intensive search in each block, it is possible to further improve a TSP tour that cannot be improved by other local search methods. To test the performance of the proposed algorithm, computational experiments are carried out based on benchmark problem instances. The computational results show that algorithm proposed in this paper is efficient for solving the TSPs.  
	%P 34 - 38