Temporally Adaptive A* Algorithm on Time-Dependent Transportation Network
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.
KeywordsTravel Time Destination Node Travel Speed Short Path Problem Traffic Information
The work described in this paper was supported by the National Natural Science Foundation of China (40871184; 41001232), the China Postdoctoral Science Foundation (20090450563) and the National High Technology Research and Develop Program of China (2007AA12Z241).
- Gao S, Lu F (2008) An arc-labeling shortest time path algorithm. Geo-Info Sci 10(5):604–610 (In Chinese)Google Scholar
- Ishikawa H (2005) Development of a local storage type traffic prediction for car navigation system. In: The 12th World Congress on intelligent transportation system, San FranciscoGoogle Scholar
- Kanoulas E, Du Y, Xia T, Zhang D (2006) Finding fastest paths on a road network with speed patterns. In: Proceedings of the 22nd international conference on data engineering (ICDE), AtlantaGoogle Scholar
- Kaufman DE, Smith RL (1993) Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. IVHS J 1:1–11Google Scholar
- Kim J, Jung S (2002) A dynamic window-based approximate shortest path re-computation method for digital road map databases in mobile environments. In: Shafazand MH, Tjoa AM (eds) EurAsia-ICT 2002, vol 2510, Lecture notes in computer science. Springer, Berlin/Heidelberg, pp 711–720Google Scholar
- Lu F, Lu D, Cui W (1999) Improved Dijkstra algorithm based on quad-heap priority queue and inverse adjacent list. J Image Graph 4A(12):1044–1050 (In Chinese)Google Scholar
- Yamane K, Endo Y, Fujiwara J, Machii K (2004) Statistical traffic information for navigation system. In: The 11th World Congress on intelligent transportation system, Nagoya, AichiGoogle Scholar