摘要
设计了一种基于Matlab实现的禁忌搜索算法 ,用以求解组合优化难题中的典型代表旅行商问题 (TSP) .分别对Hopfield原始 10城市和中国旅行商问题进行了测试 ,所得结果都能达到或优于公布的最优解 ,与传统的Hopfield神经网络求解TSP相比 ,禁忌搜索算法具有强健。
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.
出处
《西南师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2002年第3期341-345,共5页
Journal of Southwest China Normal University(Natural Science Edition)
基金
重庆市应用基础研究项目 (1997-5 775 )
教育部<高等学校骨干教师资助计划>项目 (GG -5 2 0 -10 63 5 -2 80 7)
