An Enhanced Model for Dijkstra Algorithm: Case Study Nearest Hospital in Greater Cairo-Egypt

Document Type : Original Article

Authors

1 Information System Department, Faculty of Computer Sciences and Artificial Intelligence, Beni-Suef University, Egypt

2 Department of Computer and Systems Sciences, Stockholm University, Sweden

3 Information System, Faculty of Computers and Information, Helwan University, Egypt

4 Computer Science, Faculty of Computers and Information, Helwan University, Egypt.

Abstract

The COVID-19 pandemic has increased the need for people to locate nearby healthcare facilities quickly, especially in densely populated countries like Egypt, where transportation networks are complex. The Dijkstra algorithm, commonly used to solve shortest path problems, traditionally focuses on a single destination. An enhancement for existing Dijkstra algorithm is required able to select the nearest location from multi-destinations. This study introduces an enhanced version of the Dijkstra algorithm - Enhanced Dijkstra Shortest Path Algorithm (EDSPA) - that accommodates multiple destination nodes by utilizing an endpoint list. This improvement significantly reduces execution time, enabling quicker identification of the nearest hospital and ensuring timely treatment for patients, particularly within the critical "golden hour." The proposed algorithm is adaptable to various geographic area zones with approximately the same execution time. This study provide the efficiency of the proposed algorithm by implementing the enhanced and existing Dijkstra algorithms using the same data sets and comparing the results.

Keywords

Main Subjects

Files

Share

How to cite

Statistics