Record Details

OPTIMASI RUTE TRUK PENGANGKUTAN SAMPAH DI KOTA SUMBAWA BESAR SHIFT II MENGGUNAKAN GVRP

Unisda Journal of Mathematics and Computer Science (UJMC)

View Archive Info
 
 
Field Value
 
ISSN 2579-907X
2460-3333
 
Authentication Code dc
 
Title Statement OPTIMASI RUTE TRUK PENGANGKUTAN SAMPAH DI KOTA SUMBAWA BESAR SHIFT II MENGGUNAKAN GVRP
 
Added Entry - Uncontrolled Name Hermanto, Koko
Ruskartina, Eki
Universitas Teknologi Sumbawa
Universitas Teknologi Sumbawa
 
Summary, etc. The problem of garbage in the city of Sumbawa Besar is a common problem that often occurs, as well as large cities in Indonesia. To avoid the negative impact of the existence of waste, the waste problem needs to be handled properly by improving quality and waste management, for example in terms of distribution. Set warehouse, TPS and TPA as vertices, and the connecting paths of these vertices are edgy. Arrange the shortest route for each fleet in the second shift using the generalized vehicle routing problem (GVRP) method. Then, using the clustered generalized vehicle routing problem (CGVRP) method and resolved with the Dijkstra algorithm. Obtained the total route on the second shift 85,569 meters, so that spent fuel RP 69,524, - more optimal than the route that has been used that is along 96,302 meters obtained RP. 78,245, -.
 
Publication, Distribution, Etc. Mathematics Department of Mathematics and Natural Sciences Unisda Lamongan
 
Electronic Location and Access application/pdf
http://e-jurnal.unisda.ac.id/index.php/ujmc/article/view/1156
 
Data Source Entry Unisda Journal of Mathematics and Computer Science (UJMC); Vol 4 No 2 (2018): Unisda Journal of Mathematics and Computer Science
 
Language Note eng
 
Terms Governing Use and Reproduction Note ##submission.copyrightStatement##