Meliorative tabu search algorithm for TSP problem
Zhou Xin · Computer Engineering and Applications Journal · 2008
Based on the basic concepts of traditional Tabu search algorithm,a meliorative Tabu search algorithm for solving TSP has been proposed.This algorithm has great improvement in initial solution’s production,neighbor structure and taboo strategy. Furthermore,it makes full use of heuristic information and Tabu search algorithm’s advantages.At first,this algorithm divides the cities into certain areas.Then,it connects these areas into a path,so that,we can get the initial solution.Meanwhile,we produce the cities k-neighbor list and use them with the improved taboo strategies to break through the local optimum.In this paper,we apply the algorithm to solve the CHN144 problem and some problems in TSP library(TSPLIB).The result shows that the novel algorithm can achieve satisfied solution with satisfied speed.