Abstract
The transportation main problems in a city is finding the shortest paths to reach a destination. Bandung city nowadays is experiencing high traffic. This study aimed to implement the algorithms for searching the shortest path. Many algorithms in finding the shortest paths are available. In this research, we tried a comparison between Bellman-Ford Algorithm and Dijkstra Algorithm to search the fastest path. This research used the roads in Bandung city as a case study. the initial node starts from Ir.H.Djuanda road and ends at Leuwipanjang terminal. The nodes passed are the main intersection in the Bandung city that can be skipped to the final destination. A Direct Comparison Approach method was used. The calculations have used a concept of graph and Haversine Formula for supporting a map obtained from Google Maps. The graph result was calculated using Bellman-Ford‘s Algorithm and Dijkstra's Algorithm. The results from the two algorithms were analyzed and compared. Both algorithms successfully found the best route. The result indicated that Dijkstra's algorithm can produce a shorter path compared with the Bellman-Ford Algorithm.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
