MODEL DEMAND ROBUST COUNTERPART OPEN CAPACITATED VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND DEADLINE (DRC-OCVRPtw,d) BERBASIS LINGO 13.0 DALAM MENDESAIN RUTE OPTIMAL PENGANGKUTAN SAMPAH DI KOTA PALEMBANG
Daftar Isi:
- Model DRC-OCVRPtw,d is a model that use to design the route of rubbish carriage in Palembang. By the application of LINGO 13.0, this model is expected to find the minimum distance and time that need by the vehicle to carry rubbish, so the accumulation of rubbish can be reduced. This model used parameter time windows and deadline, where as time windows consist of the time that needed by vehicle to go through the route and the time what needed to carry the rubbish to the vehicle. While, deadline is the combination of that two types of time. Rubbish that are carried every day were shared in WA (Working Area) where distance TWD (Temporary Waste Disposal) i to TWD j in one WA and so the volume of rubbish that carried will affect the duration of deadline. From the result, it can be concluded that WA 7 in Seberang Ulu I Subdistrict with distance 8.31 km and deadline during 1 hour 57 minutes become route with shortest path that completed in the fastest time because only visited one TWD in journey and WA 1 in Ilir Barat II Subdistrict with distance 61.545 km and deadline during 10 hours 3 minutes become route with the longest path that completed in the longest time because it has 8 TWD with large volumes that causes trucks must return many times to FWD (Final Waste Disposal).