Optimization of the Shortest Route Using the Djikstra Algorithm to the Nearest Covid-19 Referral Hospital for Communities Exposed to the District of Medan Baru
DOI:
10.47709/cnahpc.v7i1.5374Keywords:
shortest route, covid-19, traffic, Optimization, Dijkstra's algorithmDimension Badge Record
Abstract
Abstract: Finding the shortest route is a problem to find a path that connects two nodes with the least amount of weight. Many methods are used in finding the shortest route. One of the methods used is Dijkstra's algorithm. Dijkstra's algorithm is an excellent algorithm used in determining the shortest route from a startingpoint toan end point (destination). In this study, the determination of the shortest route from each kelurahan in the Medan Baru District to the nearest Covid-19 referral hospital can be searched maximally using the Dijkstra algorithm with the distance taken through the google maps application. However, there are some limitations that are limitations in this study. The drawbacks are traffic jams, traffic lights, one-way streets. This cannot be ignored on routes in urban areas. In the future, researchers will look for optimization of determining the shortest route by including some of the problem constraints that occur. The Dijsktra algorithm is an application that must be modernized for more complex constraints.
Downloads
Abstract viewed = 28 times
References
Uppalancha, B. K. (2015). Optimizing the robots path using Dijkstra algorithm. *International Journal of Innovative Research in Science, Engineering and Technology (IJIRSET), 4*(6).
Wang, H., et al. (2011). Application of Dijkstra algorithm in robot path-planning. *Second International Conference on Mechanic Automation and Control Engineering (MACE)*, 1067 –1069.
Irsyad, M., & Rasila, E. (2015). Aplikasi pencarian lokasi gedung dan ruangan Universitas Islam Negeri Sultan Syarif Kasim Riau pada platform Android menggunakan algoritma A-Star (A*). *Jurnal CoreIT, 1*(2)
Juhara, Z. P. (2016). *Panduan lengkap pemrograman Android.* ANDI.
Kumar, A., & Kaur, M. (2011). A new algorithm for solving shortest path problem on a network with imprecise edge weight. *Applications and Applied Mathematics: An International Journal (AAM), 6*(2), 1 –18.
Parungao, L., et al. (2018). Dijkstra algorithm-based intelligent path planning with topological map a nd wireless communication. *ARPN Journal of Engineering and Applied Sciences, 13*(8).
Orlando, T. M. (n.d.). Penerapan algoritma Dijkstra untuk menentukan rute wisata minimum kota Semarang. ITB.
Mukherjee, S. (2012). Dijkstra algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment. *Journal of Mathematical Modelling and Algorithms, 11*(4), 345 –359.
Biswas, S. S., et al. (2013). Generalization of Dijkstra algorithm for extraction of shortest path in directed multigraphs. *Journal of Computer Science, 9*(3), 377 –382.
Sanan, S., et al. (2013). Shortest path algorithm. *International Journal of Application or Innovation in Engineering & Management (IJAIEM), 2*(7), 316–320.
Lestari, S., Ardiansyah, & dkk. (2020). Dijkstra algorithm implementation in determining shortest route to mosque in residential Citra Indah City. *Jurnal PILAR Nusa Mandiri, 16*(1).
Sivakumar, S., & Chandrasekar, C. (2014). Modified Dijkstra’s shortest path algorithm. *International Journal of Innovative Research in Computer and Communication Engineering, 2*(11).
European Telecommunications Standards Institute. (1997). Digital video broadcasting (DVB): Implementation guidelines for DVB terrestrial services; transmission aspects. *ETSI TR-101-190*. Retrieved from [http://www.etsi.org](http://www.etsi.org)
Downloads
ARTICLE Published HISTORY
How to Cite
Issue
Section
License
Copyright (c) 2025 Yan Batara Putra Siringoringo, Asima Manurung, Enita Dewi Br Tarigan

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.