2Kung R M, Hanson E N, Ioannidis Y E, et al. Heuristic search in database systems[C]//Proceedings from the First International Workshop on Expert Database Systems, Kiawah Island, South Carolina, United States, 1986: 537 -548.
3Russell S, Norvig P. Artificial Intelligence: A Modern Approach[M]. 2nd ed. Prentice-Hall: Englewood Cliffs, N J, 2003.
4Nachtigall K. Time depending shortest-path problems with applications to railway networks[J]. European Journal of Operational Research, 1995, 83: 154-166.
5Sung K, Bell M, Seong M, et al. Shortest paths in a network with time-dependent flow speeds[J]. European Journal of Operational Research, 2000, 121(1): 32-39.
6Xu M H, Liu Y Q, et al. An improved Dijkstra's shortest path algorithm for sparse network[J]. Applied Mathe- matics and Computation, 2007, 185(1): 247-254.
7Ziliaskopoulos A K, Mahmassani H S. A time-dependent shortest path algorithm for real-time intelligent vehi- cle/highway systems[J]. Transportation Research Record, 1993, 1408: 94-104.
8Haldar S. An 'all pairs shortest paths' distributed algorithm using 2n^2 messages[J]. Journal of Algorithms, 1997, 24:20 -36.
9Fredman M L, Tarjan R E. Fibonacci heaps and their uses in improved network optimization algorithm[J]. Journal of the ACM, 1987, 34(3): 596-615.
10Han Y. Improved algorithm for all pairs shortest paths[J]. Inform Process Lett, 2004, 91: 245-250.
