Waste Collection Vehicle Routing Problem Model with Multiple Trips, Time Windows, Split Delivery, Heterogeneous Fleet and Intermediate Facility

Waste Collection Vehicle Routing Problem (WCVRP) is one of the developments of a Vehicle Routing Problem, which can solve the route determination of transporting waste. This study aims to develop a model from WCVRP by adding characteristics such as split delivery, multiple trips, time windows, heterogeneous fleet, and intermediate facilities alongside an objective function to minimize costs and travel distance. Our model determines the route for transporting waste especially in Cakung District, East Jakarta. The additional characteristics are obtained by analyzing the characteristics of waste transportation in the area. The models are tested using dummy data to analyze the required computational time and route suitability. The models contribute to determining the route of transporting waste afterward. The WCVRP model has been successfully developed, conducted the numerical testing, and implemented with the actual characteristics such as split delivery, multiple trips, time windows, heterogeneous fleets, and intermediate facilities. The output has reached the global optimal for both dummy and real data.