An application of the Dijkstra’s Algorithm model in finding shortest traveling time of ambulance to Hospital Kuala Lumpur
List of Authors
  • Jamilah Mohd Ghazali , Neha Siva Kumar

Keyword
  • Dijkstra’s Algorithm, node, route, HKL, algorithm

Abstract
  • Traffic congestion has become a widespread issue in many well-developed areas. This issue has mainly caused problems for ambulance services. This study was conducted to solve this issue. One of the factors of this problem is due to the increase in population. It is well known that Kuala Lumpur is a heavily populated area. Thus, this results in traffic congestion around Hospital Kuala Lumpur (HKL). The main goals of this study are to determine the shortest path between two nodes and to reduce the amount of time an ambulance needs to drive from the hospital to the accident scene. This study guarantees the Dijkstra's Algorithm method's functional efficacy within a 5-kilometer radius of HKL. As additional elements need to be taken into account, there are crucial procedures that need to be taken when using Dijkstra's Algorithm to guarantee that the time and distance computations can be approximated accurately. There are certain implicit consequences that may be detected from this project once the planning has been decided. Patients can therefore get prompt medical attention.

Reference
  • 1. Abu Kasim, J., Mohd Yusof, M. J., & Shafri, H. (2018). Urban green space degradation: An experience of Kuala Lumpur city. Environmental management and sustainable development, 2164-7682.

    2. Biswas, P., Mishra, K. P., & Mahanti, N. C. (2005). Computational efficiency of optimized shortest path algorithms. International Journal of Computer Science and applications, Volume 2, 22 – 37.

    3. Chen, J. C., & Nakamura, Y. (2003). The underlying principle of Dijkstra’s shortest path algorithm. Journal of formalized mathematics, Volume 5, 1-8.

    4. Forson, A. A. I., Jonathan, O. A., Adewoye, O., & Remi, A. J. (2009). A study of the causes, effects and ameliorative measures of road traffic congestion in Lagos metropolis. European journal of social sciences, Volume 11.

    5. Misra, J. (2001). A walk over the shortest path: Dijkstra’s Algorithm viewed as fixed-point computation. Information Processing Letters, Volume 77, 197-200.

    6. Mohd Nordin, N. A., Shuib, A., & Ismail, R. (2008). An application of the Dijkstra’s Algorithm on the ambulance dispatching and routing. Prosiding Seminar Kebangsaan Matematik & Masyarakat 2008, 222-231.

    7. Sisiopiku, V. P., Sullivan, A. J., Foster, P. J., & Fine, P. R. (2011). Emergency response and traffic congestion: the dispatcher’s perspective. Disaster Management and Human Health Risk II, Volume 119, 125-135.

    8. Sularsih, P., Moyo, E. W., Siburian, F. H., Widiyanto, S., & Agushinta, D. (2010). Mobile-based Interaction using Dijkstra's Algorithm for decision-making in traffic jam system. 2nd International Conferences on Soft Computing, Intelligent System and lnformation Technology 2010, 159-163.

    9. Wang, Z. H., Shi, S. S., Yu, L. C., & Chen, W. Z. (2011). An efficient constrained shortest path algorithm for traffic navigation. Advanced materials research, 356-360, 2880-2885.

    10. Venkat, R. J. (2014). Path finding - Dijkstra’s Algorithm. Indiana State University, 1-6.