| Article ID: | iaor20041849 |
| Country: | China |
| Volume: | 27 |
| Issue: | 3 |
| Start Page Number: | 341 |
| End Page Number: | 345 |
| Publication Date: | Jan 2002 |
| Journal: | Journal of Southwest China Normal University |
| Authors: | He Yi, Liu Guangyuan |
| Keywords: | neural networks |
Basedon Matlab 6.0, a tabu search algorithm is developed for solving the famous combinatorial optimization problem, the Traveling Salesman Problem. Citing the data of the earlier studies, having tested Hopfield/Tank original 10 cities problem and Chinese Traveling Salesman Problem, the optimum solution obtained is better than or equal to solutions as published before. Compared to traditional Hopfield Neural Networks, the method of tabu search algorithm is robust, fast and efficient.