| TSP的邻域搜索算法的分析和改进 |
| |
| 引用本文： | 赵赫,杜端甫. TSP的邻域搜索算法的分析和改进[J]. 中国管理科学, 1997, 0(1): 35-39 |
| |
| 作者姓名： | 赵赫 杜端甫 |
| |
| 作者单位： | 北京航空航天大学管理学院, 100083 |
| |
| 摘 要： | 本文分析了TSP的领域搜索算法(K-OPT)的主要特点和一些不足之处,并在此基础之上提出了一个较为有效的并且具有较低的算法复杂度的启发式算法．
|
| 关 键 词： | TSP K-OPT 启发式算法 |
| 收稿时间： | 1996-10-29; |
Analyais and Improvement of the Neighbouring Search Algorithm for FSP |
| |
| Zhao He,Du Duanfu. Analyais and Improvement of the Neighbouring Search Algorithm for FSP[J]. Chinese Journal of Management Science, 1997, 0(1): 35-39 |
| |
| Authors: | Zhao He Du Duanfu |
| |
| Affiliation: | Management School of Beijing University of Aero. & Astr |
| |
| Abstract: | This paper analyses the features of neighbor area search algorithms (K-OPT), and its shortcoming. Based on these, We proposed an efficent and lower algorithms complexity herustic method. |
| |
| Keywords: | TSP K-OPT herustic |
|
| 点击此处可从《中国管理科学》浏览原始摘要信息 |
|
点击此处可从《中国管理科学》下载全文 |
|
