You can access a short description of three of the cited papers below (the ones in bold) by clicking on the [summary] link. A presentation based on these three publications can be accessed through the following link: [Presentation]
[1] I. Chabini, "Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time," Trans-portation Research Records, vol. 1645, pp. 170-175, 1998. [Summary]
[2] G. Nannicini, P. Baptiste, G. Barbier, D. Krob, and L. Liberti, "Fast paths in large-scale dynamic road networks," Computational Optimization and Applications, vol. 45, pp. 143-158, 2010. [Summary]
[3] A. Orda and R. Rom, "Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length," J. ACM, vol. 37, pp. 607-625, July 1990.
[4] B. Ding, J. X. Yu, and L. Qin, "Finding time-dependent shortest paths over large graphs," in Proceedings of the 11th international conference on Extending database technology: Advances in database technology, ser.EDBT '08, 2008, pp. 205-216.
[5] H. Gonzalez, J. Han, X. Li, M. Myslinska, and J. P. Sondag, "Adaptive fastest path computation on a road network: a traffc mining approach," in Proceedings of the 33rd international conference on Very large databases, ser. VLDB '07, 2007, pp. 794-805.
[6] E. Kanoulas, Y. Du, T. Xia, and D. Zhang, "Finding fastest paths on a road network with speed patterns," in Proceedings of the 22nd International Conference on Data Engineering, ser. ICDE '06, 2006, pp. 10. [Summary]