Discrete Time Dependent Shortest Paths Considering Node-waiting Cost
含结点等待费用的离散时变最短路径

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.