Open AccessDetermination of minimum trucks and routes used in the case of municipal solid waste transportation in Bandung City with greedy algoritm
Author(s) -
Nur Alim Habibi,
Ari Yanuar Ridwan,
Erlangga Bayu Setyawan
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/1007/1/012037
Subject(s) - truck , greedy algorithm , municipal solid waste , heuristic , yield (engineering) , computer science , mathematical optimization , mathematics , waste management , engineering , automotive engineering , materials science , metallurgy
This study discusses the determination of the minimum number of trucks and the route of transporting the municipal solid waste, where the trucks provided have the heterogeneous capacity, namely 2 trucks with a capacity of 6 m 3 , and 2 trucks with a capacity of 10 m 3 . In this study, the heuristic method uses the greedy algorithm because it is expected that the optimal local will produce a global solution so that the expected total cost can be optimal. Based on trials conducted, obtained 3 solutions that might be used, the solution chosen using 2 trucks with a capacity of 10 m 3 .