| 用动态规划模型求解最短路问题的研究 |
| |
| 引用本文： | 王丽颖. 用动态规划模型求解最短路问题的研究[J]. 白城师范学院学报, 2008, 0(6) |
| |
| 作者姓名： | 王丽颖 |
| |
| 作者单位： | 白城师范学院数学系; |
| |
| 摘 要： | 动态规划法是求解具有多阶段的最短路径的算法,本文以动态规划理论为指导,研究了铺设管道最短路问题实例,采用顺序递推法和逆序递推法两种解决方法,并用LINGO软件编程得到结果.
|
| 关 键 词： | 动态规划 最短路径 LINGO程序 |
On Solving the Shortest Path with Dynamic Planning |
| |
| WANG Li-Ying. On Solving the Shortest Path with Dynamic Planning[J]. Journal of Baicheng Normal College, 2008, 0(6) |
| |
| Authors: | WANG Li-Ying |
| |
| Affiliation: | WANG Li-Ying(Math Department,Baicheng Normal University,Baicheng 137000,China) |
| |
| Abstract: | Dynamic programming is a multi-stage for the shortest path algorithm.This paper is guided by the theory of dynamic programming to study the examples of the problem on the laying pipelines of shortest path. It adopts two ways,a recurrence law and reversing order law.And it achieves the result using LINGO software programming. |
| |
| Keywords: | dynamic planning the shortest path lingo procedures |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
