Abstract
Dijkstra’s algorithm is one of the established algorithms that is used widely for shortest path calculation. The algorithm finds the shortest path from the source node to every other node in the network. Several variants of the Dijkstra’s algorithm have been proposed by the researchers. This paper focusses on Multi-parameter Dijkstra’s algorithm that uses multiple parameters for shortest path calculation in real road networks. The major contributions of this paper include (1) Comparison of the Dijkstra’s algorithm to Multi-parameter Dijkstra’s algorithm with special focus on real road networks, (2) Performance evaluation of Multi-parameter Dijkstra’s algorithm, (3) Time complexity analysis of Different modifications of Dijkstra’s algorithm.
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
References
Nishtha Kesswani, Dinesh Gopalani: Design and implementation of Multi-Parameter Dijkstra; s algorithm: A Shortest path algorithm for real road netwroks, International J. of Advances in Engineering Research, Vol.2, Issue 3 (2011).
Anany Levitin, Introduction to the design & analysis of algorithms, Pearson Education (2009).
F. Benjamin Zhan, “Three Fastest shortest path algorithms on Real-road networks”, Journal of Geographic information and decision analysis, Vol. 1, No.1, pp. 69–82 (2010).
Yong Xi, Loren Schwiebert, “Privacy preserving shortest path routing with an application to navigation, Pervasive and mobile computing”, Elsevier, Volume 13, pp 142–149 (2014).
Akiba, Takuya, et al. “Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling.” ALENEX. 2014, pp 147–154 (2014).
Antonio Sedeno-Noda, Andrea Raith, “A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem”, Computers & Operations Research, Elsevier, Volume 57 (2015).
A Goswami, DD Chakraborty, Optimization 2015 http://textofvideo.nptel.iitm.ac.in/111105039/lec19.pdf.
Acknowledgments
This paper provides Performance Evaluation of our previous work on Multi-parameter Dijsktra’s Algorithm published in International Journal of Advances in Engineering Research [1].
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media Singapore
About this paper
Cite this paper
Nishtha Kesswani (2017). Performance Evaluation of Shortest Path Routing Algorithms in Real Road Networks. In: Satapathy, S., Bhateja, V., Joshi, A. (eds) Proceedings of the International Conference on Data Engineering and Communication Technology. Advances in Intelligent Systems and Computing, vol 469. Springer, Singapore. https://doi.org/10.1007/978-981-10-1678-3_7
Download citation
DOI: https://doi.org/10.1007/978-981-10-1678-3_7
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-1677-6
Online ISBN: 978-981-10-1678-3
eBook Packages: EngineeringEngineering (R0)