1. Hassan, M.S., Aref, W.G, Aly, A.M.: Graph indexing for shortest path finding over dynamic sub-graphs. In: SIGMOD, pp. 1183–1197 (2016)
2. Huang, B., Wu, Q., Zhan, F.B.: A shortest path algorithm with novel heuristics for dynamic transportation networks. Int. J. Geogr. Inf. Syst. 21(6), 625–644 (2007)
3. Goto, T., Kosaka, T., Noborio, H.: On the heuristics of A∗ or A algorithm in ITS and robot path-planning. In: IEEE/RSJ International Conference on Intelligent Robots & Systems. IEEE (2003)
4. Zhang, Z., Liu, J., Qiu, A., et al.: The shortest path approximation algorithm for large scale road network. Acta Geodaetica et Cartographica Sinica 48(1), 86–94 (2019)
5. Jing, N., Huang, Y.W., Rundensteiner, E.A.: Hierarchical optimization of optimal path finding for transportation applications. In: CIKM, vol. 96, pp. 12–16 (1996)