摘要
本文从NP完全理论,组合优化理论,以及按自然法则计算等多个角度对TSP及其各种解决方法进行了论述,着重讨论了传统方法与按自然法则计算各方法的本质区别,并给出了用MTRSA解TSP的算法与实验结果.文章试图说明。
In this paper, various kinds of methodologies for solving TSP are discussed from the view of NP complete theory,combinatory optimization,and physical computation.The essential distinctions between the traditional methodology and physical computation methodology are presented.An improved simulated annealing——MTRSA is used to solve TSP.The experiment effects are given and analyzed.It is shown that physical computation may be a promising road leading to the real intelligence.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1997年第2期87-92,共6页
Journal of Computer Research and Development
关键词
旅行商问题
NP完全理论
模拟退火
组合优化
TSP,NP complete theory,physical computation,simulated annealing,combinatory optimization