摘要
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.
摘要译文
确定最佳路径或经常称为最短路径发现是具有许多益处的方法，可以应用于各种情况和科学领域。在以前的研究中，作者使用各种算法开发了最短的路径查找程序，例如持有的KARP，迭代深化搜索，双向深度首先搜索和深度有限搜索。在本研究作者，使用Dijkstra和双向Dijkstra实现了用于确定消防灾害疏散路线的信息系统的最短路径。该程序是根据Web使用Vuetify.js框架开发的。这两种算法都在几个数据集上进行了测试，并将结果进行比较，以找出强度和缺点。基于研究，算法基于使用Vuetify.js框架成功开发的算法并在多个数据集上成功测试，据称40％的测试结果表明，双向Dijkstra优于Dijkstra，10％反之亦然和50％来自两个算法的相同结果。从这种比较中可以得出结论，双向Dijkstra算法优于Dijkstra。该研究成功证明了双向Dijkstra算法可以产生比标准或经典Dijkstra算法更好的路线。
I G S Rahayuda[1]N P L Santiari[1]. Dijkstra and Bidirectional Dijkstra on Determining Evacuation Routes[J]. Journal of Physics: Conference Series, 2021,1803