References

Akiba, T., Y. Iwata and Y. Yoshida, 2014. Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. Proceedings of the 23rd International Conference on World Wide Web, April 7-11, 2014, ACM, New York, USA., pp: 237-248.

Akiba, T., Y. Iwata, K.I. Kawarabayashi and Y. Kawata, 2014. Fast shortest-path distance queries on road networks by pruned highway labeling. Proceedings of the 16th Workshop on Algorithm Engineering and Experiments, January 5, 2014, Society for Industrial and Applied Mathematics Philadelphia, PA, USA., pp: 147-154.

Bast, H., S. Funke, D. Matijevic, P. Sanders and D. Schultes, 2007. In transit to constant time shortest-path queries in road networks. Proceedings of the Meeting on Algorithm Engineering and Expermiments, January 2007, Society for Industrial and Applied Mathematics, pp: 46-59.

Chou, Y.L., H.E. Romeijn and R.L. Smith, 1998. Approximating shortest paths in large-scale networks with an application to intelligent transportation systems. INFORMS J. Comput., 10: 163-179.
Direct Link  |  

Gonzalez, H., J. Han, X. Li, M. Myslinska and J.P. Sondag, 2007. Adaptive fastest path computation on a road network: A traffic mining approach. Proceedings of the 33rd International Conference on Very Large Data Bases, September 23-28, 2007, Vienna, Austria, pp: 794-805.

Jing, N., Y.W. Huang and E.A. Rundensteiner, 1996. Hierarchical optimization of optimal path finding for transportation applications. Proceedings of the 5th International Conference on Information and Knowledge Management, November 12-16, 1996, Rockville, MD, USA., pp: 261-268.

Shehzad, F. and M.A.A. Shah, 2009. Evaluation of shortest paths in road network. Pak. J. Commerce Soc. Sci., 3: 67-79.
Direct Link  |  

Wu, L., X. Xiao, D. Deng, G. Cong, A.D. Zhu and S. Zhou, 2012. Shortest path and distance queries on road networks: An experimental evaluation. Proceedings of the VLDB Endowment, Vol. 5, August 27-31, 2012, Istanbul, Turkey, pp: 406-417.