Route Optimization of Waste Carrier Truck using Breadth First Search (BFS) Algorithm

Abstract

Waste problems have always been the main focus which still occurs in cities and regencies in Indonesia, and
also Sidoarjo Regency is no exception. Increasingly rapid population growth is one of the factors in the increasing
piles of waste in Sidoarjo Regency. The large number of villages with long distances and a large area means that waste
collection cannot be carried out on time, causing accumulation of waste that disrupts residents' daily activities. The
waste transportation system in Sidoarjo Regency has so far not been optimal because there are still several problems
with the accumulation of waste in several sub-districts.
In this study, an optimal route search system was created using the Breadth First Search and Depth First Search
Algorithms as a search comparison in order to make it easier for Sanitation Service officers to carry out the waste
transportation process by considering the optimal destination location route according to input from the user. The
results of this study will display information on the comparison of the total distance traveled and the total volume
traveled by the Breadth First Search and Depth First Search algorithms with different differences.