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

Annual Conference on Industrial and System Engineering 2019

工业技术（总论）

Dayanara, D.H.^1 ; Arvitrida, N.I.^1 ; Siswanto, N.^1

Department of Industrial Engineering, Faculty of Industrial Technology, Institut Teknologi Sepuluh Nopember, Surabaya, Indonesia^1

关键词: Ant Colony Optimization algorithms;    Deterministic demand;    Number of vehicles;    Optimization planning;    Solid waste collection;    Time window constraint;    Transportation needs;    Vehicle Routing Problems;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/598/1/012020/pdf
DOI  :  10.1088/1757-899X/598/1/012020

学科分类：工业工程学

来源: IOP

【 摘 要 】

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 planning. 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 deterministic 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 finding the optimal routes that have a minimum total distance value, this research using the approach methodology, metaheuristic with the ACO algorithm which is expected to be solved with faster computation time. The result 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 units of compactor is estimated to be able to handle the increasing demand until up to 20%.