MASALAH OPTIMASI PENGANGKUTAN SAMPAH DI KOTA PALEMBANG DENGAN MODEL DEMAND ROBUST COUNTERPART OPEN CAPACITATED VEHICLE ROUTING PROBLEM (DRC-OCVRP)
Daftar Isi:
- Demand Robust Counterpart Open Capacitated Vehicle Routing Problem (DRCOCVRP) Model has been established to optimize garbage transport in Palembang City. Vehicle starts from driver’s home to TPS in every working area and returns to TPA Karya Jaya to empty its load, so this route forms an open path with the uncertainty of garbage volume data on each TPS. This model is completed with the help of LINGO 13.0 to order to obtained the optimum route. From the results obtained, it can be concluded that the Work Area 3 in Kemuning District with a distance of 12.9 km became the route with the shortest path because only visited one TPS in they route, and the Work Area 5 in Sukarami District with a distance of 77.66 km into a route with a path farthest because of the location of TPA and between TPS that went far apart and the phenomenon of ‘back-forth’.