Vehicle Routing Problem with Split Service, Time Window and Intermediate Facility for Mumcipal Solid Waste Collection in Surabaya City with Ant Colony Optimization Algorithm

摘要

The volume of waste production in the Surabaya City from 2013 to 2017 increase in line with the population growth in the Surabaya city. The number of vehicles owned by Dinas Kebersihan dan Ruang Terbuka Hijau is limited so that in satisfying the order from every LPS in Surabaya that must be collect by the compactor, the transportation needs optimization planmng. The model for the case of MSW collection in Surabaya City is Vehicle Routing Problem with Split Service, Time Window and Intermediate Facility (VRPSSMTTWIF). The vehicles load from every LPS with determimstic demand and unload to LPA as an intermediate facility in this model. The vehicle will depart from the depot and return to the depot in a state of empty load during operating hours or with time window constraint. The vehicle will do the ritase more than once when not exceed the operational hours. In 1 LPS can be served more than once with the same vehicle or different according to the number of demand. In fmding the optimal routes that have a mimmum total distance value, this research using the approach methodology, metaheuristic with the ACQ algorithm which is expected to be solved with faster computation time. The resuh is a new recommendation route with a total distance of 4256.7 km. The difference between the existing and recommendation route is 354.4 km by using 35 vehicles. The results of the sensitivity analysis show that with the current DKRTH vehicles, the number of 44 umts of compactor is estimated to be able to handle the increasing demand until up to 20%.