A Study of the Multidirectional Dijkstra’s Algorithm in Solving the Shortest Route Problem

Abstract

This study primarily aims to save priority routes for quick emergency response in all kinds of emergency systems using the Multidirectional Dijkstra’s algorithm. This is particularly focused on finding the shortest emergency route for a vehicle traveling from the starting node to its nearest possible destination. A fictional map will also be presented which was designed to simulate a process of Multidirectional Dijkstra’s algorithm. It sorts out the entire fastest route in the shortest amount of time that could travel multiple destinations, and then vary the destination in a short period of time. This study will benefit the government or emergency departments by giving them immediate solutions for emergency problems.