Waste collection and disposal become a major problem for many metropolitan cities. Growing population, limited vehicles, and increased road traffic make the waste transportation become more complex. Waste collection involves some key considerations, such as vehicle assignment, vehicle routes, and vehicle scheduling. In the scheduling process, each vehicle has a scheduled departure that serve each route. Therefore, vehicle's assignments should consider the time required to finish one assigment on that route. The objective of this study is to minimize the number of vehicles needed to serve all routes by developing a mathematical model which uses assignment problem approach. The first step is to generated possible routes from the existing routes, followed by vehicle assignments for those certain routes. The result of the model shows fewer vehicles required to perform waste collection asa well as the the number of journeys that the vehicle to collect the waste to the landfill. The comparison of existing conditions with the model result indicates that the latter's has better condition than the existing condition because each vehicle with certain route has an equal workload, all the result's model has the maximum of two journeys for each route.

Original languageEnglish
Article number012013
JournalIOP Conference Series: Materials Science and Engineering
Issue number1
Publication statusPublished - 10 Apr 2018
Event1st International Conference on Industrial and Systems Engineering, IConISE 2017 - Denpasar, Bali, Indonesia
Duration: 29 Aug 201730 Aug 2017


Dive into the research topics of 'Optimization of municipal waste collection scheduling and routing using vehicle assignment problem (case study of Surabaya city waste collection)'. Together they form a unique fingerprint.

Cite this