摘要
经典的优化理论大多是在已知条件不变的基础上给出最优方案(即最优解),其最优性在条件发生变化时就会失去其最优性。本文提出的局内最短路问题,就是在已知条件不断变化的条件下,如何来快速的计算出此时的最优路径,文章设计了解决该问题的一个逆向标号算法,将它与传统算法进行了比较和分析,并针对实际中的物流配送管理中路径优化问题,按照不同的算法分别进行了详细的阐述与分析。
Most traditional optimization theories solve the problem on the basis that the known conditions are unchanged, which may lose their optimality in most cases with varying conditions. This paper designs a converse-label algorithm to calculate the most optimal path with changing conditions, a problem of the dynamic shortest path. Meanwhile, a comparison of the algorithm with the traditional ones is made.
关键词
局内问题
最短路
逆向标号算法
on-line problem
shortest path
converse-label algorithm
