物流配送最短径路的动态规划方法研究  

On Dynamic Programming Method in the Shortest Route of Logistics Delivery

作　　者：蒋琦玮[1] 陈治亚[1] 

机构地区：[1]中南大学交通运输工程学院,湖南长沙410075

出　　处：《系统工程》2007年第4期27-29,共3页Systems Engineering

基　　金：湖南省自然科学基金资助项目(02JJY2106)

摘　　要：确定物流配送的最短径路是提高物品时空价值的重要环节。在借鉴国内外一些研究成果的基础上,以动态规划理论为指导,选择合理的最优值函数及其自变量,列出递归关系式,并用标号法对实例进行验证。应用动态规划研究物流配送的最短径路,思路清晰,方法简便。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.

关 键 词：动态规划 物流配送 最优值函数 最短径路 

分 类 号：U491[交通运输工程—交通运输规划与管理]