含结点等待费用的离散时变最短路径

Abstract

研究了结点等待费用、弧费用和弧通过时间均为离散时变函数的最短路径问题.基于动态规划原理,给出了一种标号更新算法,可在O(n3M3)时间复杂度内求出所有结点到指定终点的最小费用路径,其中n为网络结点数、M为时间间隔数.

A special version of the Time Dependent Shortest Paths(TDSP) problem is studied in this paper.The objective is to find the minimum cost path considering node-waiting cost in a network,in which,waiting is allowed at every node and the arc-traversing cost,node-waiting cost and arc-traversing time are all discrete functions of time.An label correcting algorithm is introduced to find all the minimum cost paths from every node to the destination node simultaneously with time complexity of O(n~3M~3),where n is the number of the nodes in the network and M is the time interval count.