摘要
旅行商问题属于ＮＰ难题，不存在多项式时间的算法提出一个基于模拟退火算法求解旅行商问题的算法。
The traveling salesman problem (TSP) is shown to be NP hard and has no algorithm with polynomial time complexity In this paper, a simulated annealing based TSP algorithm is presented and then is implemented in the parallel developing environment——Multi pascal
出处
《哈尔滨理工大学学报》
CAS
1997年第5期80-83,共4页
Journal of Harbin University of Science and Technology
关键词
模拟退火算法
旅行商问题
组合优化
并行算法
simulated annealing algorithm
traveling salesman problem
NP hard
speedup
