| 物流配送最短径路的动态规划方法研究 |
| |
| 引用本文： | 蒋琦玮,陈治亚. 物流配送最短径路的动态规划方法研究[J]. 系统工程, 2007, 25(4): 27-29 |
| |
| 作者姓名： | 蒋琦玮 陈治亚 |
| |
| 作者单位： | 中南大学,交通运输工程学院,湖南,长沙,410075 |
| |
| 摘 要： | 确定物流配送的最短径路是提高物品时空价值的重要环节.在借鉴国内外一些研究成果的基础上,以动态规划理论为指导,选择合理的最优值函数及其自变量,列出递归关系式,并用标号法对实例进行验证.应用动态规划研究物流配送的最短径路,思路清晰,方法简便.
|
| 关 键 词： | 动态规划 物流配送 最优值函数 最短径路 |
| 文章编号： | 1001-4098（2007）04-0027-03 |
| 修稿时间： | 2006-06-27 |
On Dynamic Programming Method in the Shortest Route of Logistics Delivery |
| |
| JIANG Qi-wei,CHEN Zhi-ya. On Dynamic Programming Method in the Shortest Route of Logistics Delivery[J]. Systems Engineering, 2007, 25(4): 27-29 |
| |
| Authors: | JIANG Qi-wei CHEN Zhi-ya |
| |
| Affiliation: | School of Traffic and Transportation Engineering,Central South University,Changsha 410075,China |
| |
| Abstract: | Determining the shortest route of logistics delivery is very important for raising the product value of time and space applying.By analyzing some domestic and international data,and with the guide of dynamic programming theories,we choose the optimal value function and its independent variable,and establish the recursion formula for the function and variables.The idea of application of dynamic programming in the shortest route of logistics delivery is clear and the theory is reliable.In addtion,it's easy to carry out the computation.Finally,an example is given to illustrate our method,and labeling method is used to validate it. |
| |
| Keywords: | Dynamic Programming Logistics Delivery Optimal Value Function Shortest Route |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
