Dijkstra and Bidirectional Dijkstra on Determining Evacuation Routes

Abstract Determination of the best path or often called the shortest path finding is a method that has many benefits and can be applied in various cases and fields of science. In previous studies, authors have developed the shortest path finding program using various algorithms, such as held-karp, iterative deepening search, bidirectional depth first search and depth limited search. In this research author implements shortest path finding on information system for determining fire disaster evacuation route using Dijkstra and bidirectional Dijkstra. The program was developed based on web using vuetify.js framework. Both algorithms were tested on several datasets and the results will be compared to find out the strengths and weaknesses. Based on the research, the algorithm was successfully developed based on the web using the vuetify.js framework and successfully tested on several datasets, it is known that 40% of the test results show that bidirectional Dijkstra is better than Dijkstra, 10% vice versa and 50% get the same results from both algorithms. From this comparison it can be concluded that the bidirectional Dijkstra algorithm is better than Dijkstra. This research succeeded in proving that the bidirectional Dijkstra algorithm can produce a better route than the standard or classic Dijkstra algorithm.