| 货郎担问题的新解法及其算法设计 |
| |
| 引用本文： | 张银明.货郎担问题的新解法及其算法设计[J].华侨大学学报(自然科学版),1995,16(4):444-450. |
| |
| 作者姓名： | 张银明 |
| |
| 作者单位： | 华侨大学电子工程系 |
| |
| 摘 要： | 货郎担问题是运筹学中的一个著名例题。目前使用分技定界法及动态规划方法求解，本文介绍使用元素判别值进行求解的新方法及其算法设计和程序实现，它比现行方法简易有效。
|
| 关 键 词： | 运筹学 旅行商问题 元素判别值 算法 |
A New Solution of Travelling Salesman Problem and the Design of Its Algorithm |
| |
| Zhang Yinming.A New Solution of Travelling Salesman Problem and the Design of Its Algorithm[J].Journal of Huaqiao University(Natural Science),1995,16(4):444-450. |
| |
| Authors: | Zhang Yinming |
| |
| Abstract: | As a famous proposition in operation research,travelling salesman problem is solved by branch bound method and the method of dynamic programming at present.The author proposes a new method of element discrimination value with its algorithm design and program execution. The new method is proved to be simpler and more efficient than the existing ones. |
| |
| Keywords: | operation research travelling salesman problem element discrimination value algorithm design |
| 本文献已被 CNKI 维普 等数据库收录！ |
