【摘要】 针对一类动态路径规划问题 ,先利用最短路算法将其简化 ,把动态的路径规划问题转化为静态的路径规划问题 ,然后建立非线性规划模型 ,再利用最小费用最大流算法进行求解 ,得到了比较精确的结果 ,找到了一种解决传统算法一般难以求解复杂动态规划问题的方法更多还原

【Abstract】 To counter the dynamic route programming question, we simplify it with shortest route algorithm, translate it into a static route programming question, then make a no linear programming and obtain with Max flow at Min cost algorithm an accurate result. It is a way to solve dynamic route programming question which is hard to solve with traditional algorithm.更多还原