## Abstract

Traditional solutions to shortest path problems on time-varying transportation networks use traffic information only at precise moments regardless of considering the fact that the travel time through any link is dependent on the time entering that link. In this study, travel speed rather than travel time on each link is used as the time period dependent parameter to model time-dependent transportation networks, and a First-In-First-Out (FIFO) condition satisfied computational function of link travel time is then deduced based on kinematics. Finally, a temporally adaptive A* shortest path algorithm on this FIFO network is presented, where the time factor is introduced into the evaluation function, and the Euclidean distance divided by the maximum possible travel speed is used as a heuristic evaluator. An experiment on a real road network shows that the proposed algorithm is capable of foreseeing and bypassing forthcoming traffic congestion, at a cost only about 10% more in computational time than the traditional algorithm. In addition, frequent path reoptimization required with use of the traditional algorithm is effectively avoided.

## Original document

The different versions of the original document can be found in:

- http://dx.doi.org/10.1007/978-3-642-25926-5_14

- https://www.scipedia.com/public/Zheng_Lu_2012a,
- https://rd.springer.com/chapter/10.1007/978-3-642-25926-5_14,
- https://doi.org/10.1007/978-3-642-25926-5_14,
- https://dblp.uni-trier.de/db/conf/sdh/sdh2010.html#ZhengL10,
- https://academic.microsoft.com/#/detail/63403264