Comparative Analysis of Shortest Route Problem Algorithms for Emergency Response Services

Abstract

Emergency response services require a fast and shortest possible route when responding to emergency situations that include road accidents, crimes, the occurrence of fires, etc. In this regard, an efficient and robust shortest route locator is essentially important. This study primarily aims to analyze the performance of the various shortest route problem algorithms, including the regular Dijkstra’s algorithm, the Bidirectional search algorithm, and the Multidirectional Dijkstra’s algorithm (MDA). The implementations of these algorithms are evaluated and compared in order to determine which algorithm can be an excellent choice to be adopted by such emergency response services. The results showed that the MDA has efficient performance in both light and heavy traffic situations in terms of speed and response times.