Modelling tank truck routing for city park watering problems in Surabaya

Abstract

Surabaya City Government tries to have 20% public and 10% private green open space to obey regulation of Indonesian Law No. 26/2007, so that the City Government is actively increasing the number of public green space by creating city parks. With the ever-increasing amount of green open space, maintenance activities are needed, one of which is to do routine watering every day. The problem often faced by the City Government is determining the truck routes to optimize traveling time. Many variables can affect this traveling time, among others, demand, number of vehicles, vehicle capacity, time windows, operating hours and vehicle routes. In practice, a large number of watering locations, irregular routes, and uneven service area assignments often result in overtime which impacts the next shift working hours. The water truck routing problem can be categorized as NP Hard so that the process of scheduling and determining routes use Ant Colony. The objective of this study is to develop a model that can minimize the total routing time and the number of vehicles in the process of filling and watering from the depot to the park. The scenarios developed provides savings in terms of time minimization and distribution of assignments.