Comparison of Floyd-Warshall Algorithm and Greedy Algorithm in Determining the Shortest Route

Abstract

Prior to traveling, one of the most important things to pay attention to is to determine the travel route, especially the shortest path to be taken. In this study, the method used to determine the shortest route is the conventional method and the Heuristic method. These two methods will be compared to find out methods which can provide the best result. For conventional methods, the authors use the Floyd- Warshall algorithm whereas for the Heuristic method, the greedy algorithm is employed. The Floyd-Warshall algorithm takes into account all possible routes so that there are some routes are displayed while the greedy algorithm checks every node that is passed to select the shortest route (Local Optimum) so that the time needed in searching is faster. Based on the conducted testing, the final result obtained is the Floyd- Warshall algorithm provides a better solution, namely the mileage was 22.7 km and the greedy algorithm covered a mileage of 24.8 km. This result indicated that a longer time is required because it takes the distance to all points into account.