Minimum-Time Path in Network with Time-Dependent Flow Speed

The model and solution of the shortest path problem on time-dependent network, where the travel time of each arc depends on the entrance time to this arc, violates the FIFO property. This paper proposes a new model for time-dependent network where the flow speed of each arc depends on the time that is applicable to traffic and transportation. Besides, each arc of the network in this model as demonstrated in this paper satisfies the FIFO property and the traditional algorithm can resolve the minimum-time path problem. Finally this paper gives an example to illustrate the accuracy of this algorithm.