Study on the Conversion of Non-FIFO Arc in Time-dependent Networks
Hongzhong Chen · Journal of Chinese Computer Systems · 2009
Traditional algorithm can not effectively find out the shortest paths in time-dependent networks. The reason is that there are non-FIFO arcs in time-dependent networks. This paper studies on the method of converting the non-FIFO arcs into FIFO arcs in the condition of the function of this arcs is non-continuous (exist only limited non-continuous points) or discrete, then proposes the algorithm to solve this problem in the prerequisite of allowing wait. Based on the traditional Dijkstra algorithm, this paper develops the improved shortest-path in time-dependent network.