Survey of shortest Path Algorithms

International Journal of Computer Science and Engineering
© 2019 by SSRG - IJCSE Journal
Volume 6 Issue 11
Year of Publication : 2019
Authors : Dr. Shaveta Bhatia

How to Cite?

Dr. Shaveta Bhatia, "Survey of shortest Path Algorithms," SSRG International Journal of Computer Science and Engineering , vol. 6,  no. 11, pp. 33-39, 2019. Crossref,


Now days in computer network routing is based on the shortest path problem algorithms.This paper main objective is to evaluate and compare different shortest path algorithms like Dijkstra algorithm floyd-washall algorithm bellman ford algorithm and genetic algorithm and more which are used in solving shortest path problems. A short review is performed on various types of shortest path algorithm.A framework of genetic algorithm for finding optimal solutions to the shortest path problem is presented.The result of evaluating the Dijkstra,Floyd,warshall and bellman-ford algorithm along with their time complexity conclude the paper.


Algorithms, Forklifts route, Logistics costs, Optimization, Time complexity


[1] C. Ugwu, and D. Bale, “An application of Fuzzy Logic model in solving Road Traffic congestion,” International Journal of Engineering Research & Technology (IJERT),2014.
[2] Oxford Dictionary, Retrieved July 10, 2015
[3] BusinessDictionary,, Retrieved July 10, 2015
[4] X. Wei-Cheng, C. Chang-Min, F. Song-Song, and L. Ling-Ling, “A Vehicle routing optimization method with constraints condition based on Max-Min Ant Colony Algorithm”, Applied Mathematics & Information Sciences International Journal, 2014.
[5] J. Karskens, “Mail Delivery Problem Route Optimization with Capacity Constraints”, Retrieved July, 2015
[6] T. Caric, and H. Gold, “Vehicle Routing Problem,” In-Teh Croatian branch, I-Tech Education and Publishing KG, Vienna, Austria, 2008.
[7] M. Andersson, and P. Lindroth, “Route optimization applied to school transports – Amethod combining column generation with greedy heuristics,” SE-412 96 Göteborg, Sweden, 2005.
[8] LiQi and penman efficient algorithm named Li-Qi(LQalgorith)
[9] M. F. Qureshi, S. M. Ali Shah, and G.I.G. Al-Matroushi, “A Comparative Analysis of Multi-Criteria Road Network,” European Centre for Research Training and Development UK, 2013.
[10], Rodney, Charles Hester, and Perry
[11] D. Wilkie, J. Berg, M. Lin, and D. Manocha, “Self-Aware Traffic Route Planning,” Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2012.
[12] A. V. Goldberg, and C. Harrelson, “Computing the Shortest Path: A* Search meets Graph Theory,” Proceedings of the 16th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA’05), 2005, pp. 156–165.
[13] F. Fuchs, “On Preprocessing the ALT-Algorithm,” KIT – University of the State of Baden-Wuerttemberg and National Laboratory of the Helmholtz Association, 2010.
[14] D J Dean. "Finding optimal routes for networks of harvest site access roads using GIS-based techniques", Canadian Journal of Forest Research, 1997
[15] R. Geisberger, P. Sanders, D. Schultes, and D. Delling, “Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks,” 2011.
[16] Submitted to VIT UniversitybyIvan Beker, VesnaJevtić, DaliborDobrilović.
[17] J. Voracek, “Prediction of mechanical properties of cast irons,” Appl. Soft Comput. 2001,1 pp. 119-125.
[18] S. L. Guarino, J.D. Pfautz, Z. Cox, and E. Roth, “Modeling human reasoning about meta-information,” Int. J. Approx. Reason. 2009, 50 pp. 437-449.
[19] O. Kulak, M. B. Durmusoglu, and C. Kahraman, “Fuzzy multi-attribute equipment selection based on information axiom,” J. Mater. Process. Technol, 2005, 169 pp. 337-345.
[20] Y. Murat, and N. Uludag, “Route choice modelling in urban transportation networks using fuzzy logic and logistic regression methods,” Journal of Scientific & Industrial Research, 2008 vol. 67, pp. 19-27.
[21] T. Bossomajer, and G. David, “Complex Systems,” Cambridge University Press, Cambridge, UK, 2000.