IMPLEMENTASI ALGORITMA BELLMAN-FORD DALAM MENENTUKAN LINTASAN TERPENDEK TRUK PEMBUANGAN SAMPAH

IMPLEMENTATION OF THE BELLMAN-FORD ALGORITHM IN DETERMINING THE SHORTEST PATH OF THE TRUCK WASTE DISPOSAL SHE ARSSY YESTI 11654200788 Date of Final Exam : 12 January 2022 Date of Graduation : Mathematics Study Program Faculty of Science and Technology State Islamic University of Sultan Syarif Kasim Riau Soebrantas Street No.155 Pekanbaru ABSTRACT The problem of determining the shortest relationship with the fastest distance traveled. This is very important in the life of urban communities in all respects, one of which is in terms of transporting waste. The number of routes to be reached becomes a benchmark for getting to the destination. With this it can be determined which points will be traversed so that they can reach a short distance using the Bellman-Ford algorithm. This study describes a short access road for garbage disposal trucks in the city of Taluk Kuantan using the Bellman-Ford algorithm. The steps in determining the shortest path using the Bellman-Ford algorithm are converting the map into a directed and weighted graph, determining the starting and destination points, marking 0 at the starting point and marking at other points, iterating starting from the starting point and iterating over and over. to the end point or destination. This research aims to determine the limitations so that the time and use are more efficient. The data is in the form of TPS that are visited by garbage trucks every day with the starting point being the Kuantan Singingi Environmental Service office and the ending point being TPA Sentajo. The results of this study indicate that there is 1 shortest path from the Kuantan Singingi Environmental Service Office to the Sentajo TPA with a minimum distance of 17.2 km. Keywords: Bellman-Ford algorithm, route, shortest path