| 狭义TSP几何解的演化逻辑与算法 |
| |
| 引用本文： | 王锦彪. 狭义TSP几何解的演化逻辑与算法[J]. 计算机工程, 2005, 31(14): 77-79,230 |
| |
| 作者姓名： | 王锦彪 |
| |
| 作者单位： | 中国民航学院计算机科学与技术学院,天津,300300 |
| |
| 基金项目： | 国家自然科学基金资助项目(69732010)，国航天津分公司重点科研基金资助项目 |
| |
| 摘 要： | 在文献的基础上定义了狭义TSP。提出了6类边权亏损，指出了几何解的演化逻辑决定数值解的收敛性。新算法的时间复杂性为O(n^3)，算例表明，解的质量一般不大于1.05倍TSPLIB公布的最优解。
|
| 关 键 词： | 狭义TSP 几何解演化逻辑 边权亏损 |
| 文章编号： | 1000-3428(2005)14-0077-03 |
Evolution Logic and Algorithm for Narrow TSP Geometric Solution |
| |
| WANG Jinbiao. Evolution Logic and Algorithm for Narrow TSP Geometric Solution[J]. Computer Engineering, 2005, 31(14): 77-79,230 |
| |
| Authors: | WANG Jinbiao |
| |
| Abstract: | A defination is given based on the reference[1].The six categories boundaries weight loss are first proposed. It is pointed out that theevolution logic of the geometric solution determines the convergence of the digital solution. The time complexity of the new algorithom is O(n3).The computation example demonstrates that the quality of the solution is generally not bigger than the 1.05 times of the optimal solution publiced byTSPLIB. |
| |
| Keywords: | Narrow sense TSP Logic geometric solution evolution Boundary weight loss |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
