Abstract
A Double-Sources shortest path algorithm for urban road networks is proposed in this paper. In typical urban road networks, the probability that the ratio of the shortest path length to the Euclidean distance denoted by |SD| between source station and destination station is smaller than 1.414, is larger than 95%. Based on Dijkstra algorithm and the characteristics of the typical urban road networks, this algorithm starts at searching for the shortest path from the source station and destination station respectively and simultaneously and ends at having found all stations which are less than 0.702|SD| far from the source station or destination station. Compared to the single-source Dijkstra algorithm, theory analysis and experimental results both show that the algorithm can great reduce the time-complexity, especially on condition that stations in urban road networks uniformly distribute.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Math. 1, 269–271 (1959)
Ma, D.L.: Research of the shortest path algorithm of urbanized public traffic networks. Science & Technology Information 26, 15 (2008)
Fu, M.Y., Li, J., Deng, Z.H.: A Practical Route planning Algorithm for Vehicle Navigation System. In: Proceedings of the 5th World Congress on Intelligent Control and Automation, p. 5327. WCICA, Hangzhou (2004)
Nordbeck, S., Rystedt, B.: Computer Cartography: Shortest route Programs. The Royal University of Lund, Sweden (1969)
Lu, F., Lu, D.M., Cui, W.H.: Time Shortest Path Algorithm for Restricted Searching Area in Transportation Networks. Journal of Image and Graphics 4(10), 849–853 (1999)
Wang, S.M., Xing, J.P., Zhang, Y.T., Bai, B.H.: Ellipse-based shortest path algorithm for typical urban road networks. Systems Engineering Theory & Practice 31(6), 1158–1164 (2011)
Wang, Y.W., Wang, X.L., Cao, H.: Shortest Route-planning Algorithm within Dynamic Restricted Searching Area. Application Research of Computers 24(7), 89–91 (2007)
Fu, M.Y., Li, J., Deng, Z.H.: A Route Planning Algorithm for the Shortest Distance within a Restricted Searching Area. Transactions of Beijing Institute of Technology 24(10), 882 (2004)
Zhou, Y., Cao, J., Li, J.X.: A Shortest Route-Planning Algorithm within a Restricted Area. Microelectronics & Computer 24(8), 110–112 (2007)
Divitin, M., Simone, C.: Supporting Different Dimensions of Adaptability in Workflow Modeling. Computer Supported Cooperative Work 9(3/4), 365–397 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Wang, S. et al. (2012). Double-Sources Dijkstra Algorithm within Typical Urban Road Networks. In: Xie, A., Huang, X. (eds) Advances in Computer Science and Education. Advances in Intelligent and Soft Computing, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27945-4_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-27945-4_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27944-7
Online ISBN: 978-3-642-27945-4
eBook Packages: EngineeringEngineering (R0)