| 货郎担问题新算法 |
| |
| 引用本文： | 韩德.货郎担问题新算法[J].装甲兵工程学院学报,2006,20(1):94-98. |
| |
| 作者姓名： | 韩德 |
| |
| 作者单位： | 装甲兵工程学院非线性科学研究所,北京,100072 |
| |
| 摘 要： | 将指派问题的匈牙利解法用于货郎担问题,通过恰当地添加大正数构造效率矩阵,得到了计算货郎担问题较快的算法。文中给出的2个例子具体地说明了算法实施过程,该算法具有一定的实用性。
|
| 关 键 词： | 指派问题 匈牙利解法 效率矩阵 TSP问题 |
| 文章编号： | 1672-1497(2006)01-0094-05 |
| 修稿时间： | 2005年10月20 |
A New Algorithm for Solving Traveling Salesman Problem |
| |
| HAN De.A New Algorithm for Solving Traveling Salesman Problem[J].Journal of Armored Force Engineering Institute,2006,20(1):94-98. |
| |
| Authors: | HAN De |
| |
| Abstract: | obtaining a better algorithm for solving the Traveling Salesman Problem by applying Hungarian method of assignment problem to it and by adding largely positive numbers in place on a matrix to construct the efficiency matrices. This algorithm gives two examples and concretely explains actual procedures implementing the algorithm and makes it practicable. |
| |
| Keywords: | assignment problem Hungarian method efficiency matrices TSP problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
