# Finding Shortest Path for Road Network Using Dijkstra’s Algorithm

• Md. Almash Alam Lecturer, Department of Computer Science and Engineering, Bangladesh Army University of Engineering & Technology, Natore, Bangladesh
• Md. Omar Faruq Lecturer, Department of Computer Science and Engineering, Bangladesh Army University of Engineering & Technology, Natore, Bangladesh
Keywords: Shortest Path; Dijkstra’s Algorithm; Breadth First Search; Maximum Number of Nodes.

### Abstract

Roads play a Major role to the people live in various states, cities, town and villages, from each and every day they travel to work, to schools, to business meetings, and to transport their goods. Even in this modern era whole world used roads, remain one of the most useful mediums used most frequently for transportation and travel. The manipulation of shortest paths between various locations appears to be a major problem in the road networks. The large range of applications and product was introduced to solve or overcome the difficulties by developing different shortest path algorithms. Even now the problem still exists to find the shortest path for road networks. Shortest Path problems are inevitable in road network applications such as city emergency handling and drive guiding system. Basic concepts of network analysis in connection with traffic issues are explored. The traffic condition among a city changes from time to time and there are usually huge amounts of requests occur, it needs to find the solution quickly. The above problems can be rectified through shortest paths by using the Dijkstra’s Algorithm. The main objective is the low cost of the implementation. The shortest path problem is to find a path between two vertices (nodes) on a given graph, such that the sum of the weights on its constituent edges is minimized. This problem has been intensively investigated over years, due to its extensive applications in graph theory, artificial intelligence, computer network and the design of transportation systems. The classic Dijkstra’s algorithm was designed to solve the single source shortest path problem for a static graph. It works starting from the source node and calculating the shortest path on the whole network. Noting that an upper bound of the distance between two nodes can be evaluated in advance on the given transportation network.

### References

Aghaei, M. R. S., Zukarnain, Z. A., Mamat, A., & Zainuddin, H. (2008, December). A Hybrid Algorithm for the Shortest-path Problem in the Graph. In 2008 International Conference on Advanced Computer Theory and Engineering (pp. 251-255). IEEE.

Abbas, M. A., Chumachenko, S. V., Hahanova, A. V., Gorobets, A. A., & Priymak, A. (2013, September). Models for quality analysis of computer structures. In East-West Design & Test Symposium (EWDTS 2013) (pp. 1-6). IEEE.

Alzahrani, A. S., & Woodward, M. E. (2008, November). End-to-end delay in localized qos routing. In 2008 11th IEEE Singapore International Conference on Communication Systems (pp. 1700-1706). IEEE.

Dobrilovic, D., Jevtic, V., Beker, I., & Stojanov, Z. (2012, May). Shortest-path based model for warehouse inner transportation optimization. In 2012 7th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)(pp. 63-68). IEEE.

Fuhao, Z., & Jiping, L. (2009, August). An algorithm of shortest path based on Dijkstra for huge data. In 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery (Vol. 4, pp. 244-247). IEEE.

Guo, L., Yang, Q., & Yan, W. (2012, September). Intelligent path planning for automated guided vehicles system based on topological map. In 2012 IEEE Conference on Control, Systems & Industrial Informatics (pp. 69-74). IEEE.

Jan, G. E., Lee, M. C., Hsieh, S. G., & Chen, Y. Y. (2009, July). Transportation network navigation with turn penalties. In 2009 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (pp. 1224-1229). IEEE.

Jigang, W., Han, P., Jagadeesh, G. R., & Srikanthan, T. (2010). Practical algorithm for shortest path on large networks with time-dependent edge-length. In 2010 2nd International Conference on Computer Engineering and Technology.

Jain, A., Datta, U., & Joshi, N. (2016). Implemented modification in Dijkstra‟ s Algorithm to find the shortest path for N nodes with constraint. International Journal of Scientific Engineering and Applied Science, 2(2), 420-426.

Wu, H., Marshall, A., & Yu, W. (2007, July). Path planning and following algorithms in an indoor navigation model for visually impaired. In Second International Conference on Internet Monitoring and Protection (ICIMP 2007) (pp. 38-38). IEEE.

Wang, H., Hu, M., & Xiao, W. (2010, March). A new public transportation data model and shortest-path algorithms. In 2010 2nd International Asia Conference on Informatics in Control, Automation and Robotics (CAR 2010) (Vol. 1, pp. 456-459). IEEE.

Xiao, J. X., & Lu, F. L. (2010, February). An improvement of the shortest path algorithm based on Dijkstra algorithm. In 2010 The 2nd International Conference on Computer and Automation Engineering (ICCAE) (Vol. 2, pp. 383-385). IEEE.

Yin, C., & Wang, H. (2010, June). Developed Dijkstra shortest path search algorithm and simulation. In 2010 International Conference on Computer Design and Applications (Vol. 1, pp. V1-116). IEEE.

Zhang, Z., Jigang, W., & Duan, X. (2010, December). Practical algorithm for shortest path on transportation network. In 2010 International Conference on Computer and Information Application (pp. 48-51). IEEE.

Zhan, F. B., & Noon, C. E. (1998). Shortest path algorithms: an evaluation using real road networks. Transportation science, 32(1), 65-73.

Zhou, W., Qiu, Q., Luo, P., & Fang, P. (2013, June). An improved shortest path algorithm based on orientation rectangle for restricted searching area. In Proceedings of the 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD) (pp. 692-697). IEEE.

Published
2019-07-29
How to Cite
Alam, M. A., & Faruq, M. O. (2019). Finding Shortest Path for Road Network Using Dijkstra’s Algorithm. Bangladesh Journal of Multidisciplinary Scientific Research, 1(2), 41-45. https://doi.org/10.46281/bjmsr.v1i2.366
Issue
Section
Research Paper/Theoretical Paper/Review Paper/Short Communication Paper