Research on Solving TSP in Tabu Search Algorithm
Zhengguang Liu · Journalof Southwest China Normal University · 2002
Based on Matlab 6.0, a tabu search algorithm is developed for solving the famous combinatorial optimization problem-Traveling Salesman Problem. Citing the data of the 7th and the 8th references, having tested Hopfield/Tank original 10 cities problem and Chinese Traveling Salesman Problem, the optimum solutions obtained are better or equal solutions as published before . Compared to traditional Hopfield Neural Networks, the method of tabu search algorithm is robust, fast and efficient.