DESAIN RUTE OPTIMAL PERMASALAHAN PENGANGKUTAN SAMPAH DI KOTA PALEMBANG MENGGUNAKAN MODEL DEMAND ROBUST COUNTERPART OPEN CAPACITATED VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND DEADLINE (DRC-OCVRPtw,d) BERBASIS LINGO 13.0
Daftar Isi:
- In addition to require an optimal route, garbage transportation in Palembang at this time needs to be searched for the deadline of garbage transportation. Therefore, this research aims to find the optimal route of garbage transportation in Palembang by using the DRC-OCVRPtw,d method. This research, discussion of the preparation of Demand Robust Counterpart Open Capacitated Vehicle Routing Problem with Time Windows and Deadline models (DRC-OCVRPtw,d) and applying the DRC-OCVRPtw,d method in each work area of nine subdistricts in Palembang. Are conducted DRC-OCVRPtw,d model is a formulation of the DRC-OCVRP model with time windows and deadline added parameters. In general the result of research showed that the average distances each Working Area (WA) ranges from 10-30 km, but there exist some vehicle distances that are very far reaching 60-110 km on several WA. And The deadline for transporting garbage every time around the highway ranges from 2-5 hours, but there is a very long deadline time reaching 7-8 hours and the route of transporting garbage up to three times the transport to the Final Waste Disposal (FWD) on several WA. From the results obtained it can be concluded that the greater the distance between Temporary Waste Disposal (TWD) to TWD, FWD to TWD and the more TWD points in one WA, the greater the vehicle mileage. And The greater the distance, the volume of garbage at TWD and more TWD points in one WA, the greater the deadline for transporting garbage in one WA. The completion of DRC-OCVRPtw,d method in this research based on Lingo 13.0, so that the results obtained of minimum distance and minimum time.