Comparison of Algorithms for Searching Shortest Path and Implementations for the Searching Routing System via Web Services
Abstract— The searching routing system is part of logistics systems. There are many algorithms to solve the detail of confuse routing, e.g., routing of transport networks or order picking areas. The numbers of relevant nodes in routing have more than 10,000 nodes. Then many algorithms should be finding the shortest path from start node to destination. In this paper, we choose 3 algorithms compose of Floyd-Warshall’s Algorithm, Dijkstra’s Algorithm and saving algorithm with google map api to compare the best algorithm to searching shortest path and then choose the best algorithm to implement searching routing system via web services. For the results, Floyd-Warshall’s Algorithm and Dijkstra’s Algorithm give same results but the results from saving algorithm with google map api is the best algorithm for searching and manage the transport route to the point of destination especially in the real time. Then, this research will use saving algorithm for solving the ordering of transportation and use Google maps API for set direction. Google maps API can advise the shortest path and mark start node, end node for user. Saving algorithm find the best route and calculate the result from equation.
Index Terms— floyd-warshall’s algorithm, dijkstra’s algorithm, saving algorithm, Google maps API, shortest path.
Department of Computer Science, Faculty of Science King Mongkut’s Institute of Technology Ladkrabang, THAILAND
Cite: Pattama Charoenporn, "Comparison of Algorithms for Searching Shortest Path and Implementations for the Searching Routing System via Web Services," Proceedings of 2018 the 8th International Workshop on Computer Science and Engineering, pp. 516-520, Bangkok, 28-30 June, 2018.