Penentuan Jalur Tercepat dan Terpendek Berdasarkan Kondisi Lalu Lintas di Kota Bogor Menggunakan Algoritme Dijkstra dan Algoritme Floyd-Warshall
Abstract
Bogor is one of the major cities in Indonesia which have congestion problems large enough at some point. The congestion partly caused by the large number of public transport and private vehicles which circulating on the road, both are considered to have exceeded the capacity of the streets of the Bogor city . One alternative that can be offered to deal with this congestion is determine the best path to follow. The best path is the fastest path or the shortest path that used to achieve a place in the Bogor city in accordance with the conditions of the road traffic density. Dijkstra algorithm and Floyd algorithm Warshal as shortest path algorithm which is excellent in providing optimum value is used to support the of the best path with the most optimal travel time. The research resulted in a system that is able to produce the fastest path and the shortest path along with the approximate distance, estimated travel time and time of arrival. The function to determine the fastest path is capable of generating the fastest path adjusted to the results of the displacement time. Hence, the system always provide the path with the most optimal travel time.
Collections
- UT - Computer Science [2255]