摘要
将动态规划思想运用到求解运输问题最短路径中,将运输过程划分为几个阶段,在每阶段中选取最优策略,最后找到整个过程的总体最优目标即最短径路。给出了动态规划方法的基本原理,建立了动态规划数学模型,通过一个实际应用例子具体说明动态规划求解运输问题最短路径过程,并总结出动态规划在此类问题中的优越性。
The Dynamic Programming thought is applied to Solving the Shortest-Path of Transportation Problem, transportation process is divided to several sections ,choose optimal strategy of each section, finally,find the entire optimal strategy of the whole process. The basic principle of Dynamic Programming is introduced and a mathematical model of Dynamic Programming is established. The process of Solving the Shortest-Path of Transportation Problem is described by a practical application case ,which show the advantage of Dynamic Programming.
出处
《机械设计与制造》
北大核心
2010年第2期223-224,共2页
Machinery Design & Manufacture
关键词
动态规划
最短路径
多阶段决策
Dynamic programming
The shortest-Path
Multistage decision
