Study on Non-FIFO Arc in Time-Dependent Networks

This paper points out that the reason why the traditional shortest-path algorithms can not effectively find out the shortest paths in time-dependent networks is the existence of non-FIFO arc, and presents the discriminant theorem to distinguish non-FIFO arc from FIFO arc. The paper also provides the method to discriminate the non-FIFO arc and calculate the waiting interval and the optimal departure time of non-FIFO arc, and converts non-FIFO arc into FIFO arc. Based on the traditional Dijkstra algorithm, this paper develops the improved shortest-path algorithm in time-dependent network.