Abstract
Incremental search technique is used to solve fully dynamic shortest path problems. It uses heuristics to focus their search and reuse information from previous searches to find solutions to series of similar search tasks much faster than is possible by solving each search task from the scratch. This paper focused on improving the speed of computation time, a novel algorithm has been developed that combines the incremental search \( {\text{OLPA}}^{*} \) algorithm and bi-directional heuristic search approach. The idea of using the bi-directional heuristic search is to reduce the search space and then reduce the number of node expansions. This novel algorithm has been called the Bidirectional Lifelong \( {\text{A}}^{*} \) algorithm [\( {\text{BiOLPA}}^{*} \)]. The experimental results demonstrate that the \( {\text{BiOLPA}}^{*} \) algorithm on road network is significantly faster than the \( {\text{LPA}}^{*} \), \( {\text{OLPA}}^{*} \) and \( {\text{A}}^{*} \) algorithms, not only in terms of number of expansion nodes but also in terms of computation time. Furthermore, this research provides some additional measurements to back our claims regarding the effect of blocked link location to the goal and the performance of our \( {\text{BiOLPA}}^{*} \) algorithm approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akiba, T., Iwata, Y., Kawarabayashi, K., Kawata, Y.: Fast shortest-path distance queries on road networks by pruned highway labelling. In: McGeoch, C.C., Meyer, U. (eds.) 2014 Proceedings of the 16th Workshop on Algorithm Engineering and Experiments (ALENEX), Portland, Oregon, 5 January 2014, pp. 147–154. Society for Industrial and Applied Mathematics, Philadelphia (2014)
Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast routing in road networks with transit nodes. Science 316(5824), 566 (2007)
Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, SODA 2002, 6–10 January 2002, pp. 937–946. Society for Industrial and Applied Mathematics, San Francisco (2002)
Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)
Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: Proceedings of the 7th International Workshop on Experimental Algorithms (WEA 2008), Provincetown, MA, 30 May–01 June 2008, pp. 319–333. Springer, Heidelberg (2008)
Klunder, G., Post, H.: The shortest path problem on large-scale real-road networks. Networks 48(4), 182–194 (2006)
Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning A*. Artif. Intell. 155(1–2), 93–146 (2004)
Russell, S., Norvig, S.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice Hall, Englewood Cliffs (2009)
Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: ESA 2005 Proceedings of the 13th Annual European Conference on Algorithms, Palma de Mallorca, Spain, 03–06 October 2005, pp. 568–579. Springer, Heidelberg (2005)
Pohl, I.: Bi-directional search. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol. 6, pp. 127–140. Edinburgh University Press, Edinburgh (1971)
Pohl, I.: Bi-directional and heuristic search in path problems. Technical report 104, SLAC (Stanford Linear Accelerator Center), Stanford, California (1969)
Wu, L., Xiao, X., Deng, D., Cong, G., Zhu, A., Zhou, S.: Shortest path and distance queries on road networks: an experimental evaluation. Proc. VLDB Endow. 5(5), 406–417 (2012)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Hartley, J., Alhoula, W. (2019). Fast Replanning Incremental Shortest Path Algorithm for Dynamic Transportation Networks. In: Arai, K., Bhatia, R., Kapoor, S. (eds) Intelligent Computing. CompCom 2019. Advances in Intelligent Systems and Computing, vol 997. Springer, Cham. https://doi.org/10.1007/978-3-030-22871-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-22871-2_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-22870-5
Online ISBN: 978-3-030-22871-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)