Skripsi
OPTIMASI RUTE LOGISTIK SAMPAH DESA PULAU SEMAMBU DENGAN MODEL DEMAND ROBUST COUNTERPART OPEN CAPACITATED VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND DEADLINE (DRC-OCVRPTWD) MENGGUNAKAN METAHEURISTIK MODIFIED GREY WOLF OPTIMIZER
Waste management in Pulau Semambu Village requires efficient vehicle routing from various Temporary Waste Disposal Sites (TWD) to the Final Waste Disposal Site (FWD). This study aims to determine the optimal waste vehicle routes by applying the Modified Grey Wolf Optimizer (MGWO) method to the Demand Robust Counterpart Open Capacitated Vehicle Routing Problem with Time Windows and Deadline (DRC-OCVRPtw,d) model. This model is utilized to ensure that waste collection remains optimal under waste volume uncertainty (robustness), while adhering to a vehicle capacity constraint of 3 tons, time windows, and deadlines. The data used include the coordinates of TPS across Dusun 1 to Dusun 6, waste volumes, vehicle capacity, as well as distance and travel time data. Calculations were performed separately for each working area (WA) using specified MGWO parameters, including a wolf population of 4 and a maximum iteration limit of 3. The results indicate that the application of MGWO to the DRC-OCVRPtw,d model produces relatively shorter travel distances compared to previous studies using Genetic Algorithm (GA) and Simulated Annealing (SA) on a standard VRP. This outcome is subject to the maximum vehicle capacity, which necessitates two trips for each working area. The generated optimal routes are 11.63 km for WA-1, 13.58 km for WA-2, and 14.24 km for WA-3. Despite the increased complexity of the model due to time windows and deadline constraints, the MGWO method proves to have advantages in terms of convergence speed and solution stability compared to the GA and SA methods in determining the most effective waste logistics routes in Pulau Semambu Village.