Optimizing Waste Collection Routes in Purwokerto using the Dijkstra Algorithm

Waste is a complex problem that has the potential to cause environmental degradation if not handled properly. Waste management in Banyumas Regency, particularly in the Purwokerto area, encounters several fundamental limitations, including the limited capacity of the transportation fleet and the lack of an integrated route distribution system. Based on the documentation of the Banyumas Regency Environmental Service, of the total daily waste generation amounting to 600 tons, only 45% is transported to the Final Disposal Site (TPA), highlighting the urgent need for optimization in the waste management system. This study applies the Dijkstra Algorithm using the greedy principle, which weights the distances between points and calculates the minimum value to develop a simulation for determining the shortest route for transporting waste from the Temporary Shelter (TPS) to the TPA in Purwokerto. The results of the computational analysis indicate that the optimal route from the Environmental Service office to the TPA/PDU Tanjung is 10.553 kilometers long, involving eight stages of algorithmic iteration. This finding confirms the efficiency of the route compared to other alternatives, supporting the acceleration of waste reduction and handling targets in alignment with the Banyumas Regency's strategic policy directives