OPTIMASI RUTE TRUK PENGANGKUTAN SAMPAH DI KOTA SUMBAWA BESAR SHIFT II MENGGUNAKAN GVRP
Abstract
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, -.
References
[2] Fauzi, Imron 2011, Penggunaan Algoritma Dijkstra Dalam Pencarian Rute Tercepat Dan Rute Terpendek (Studi Kasus Pada Jalan Raya antara Wilayah Blok M dan Kota).
[3] Gendreau, Michel. Dkk. 2010. A Tabu Search Heuristic for the Vehicle Routing Problem. Jstor. Management Science, Vol. 40, No. 10 (Oct., 1994), pp. 1276-1290.
[4] Ghiani, G., dan Improta, G. An efficient transformation of the generalized vehicle routing problem, Eur. J. Oper. Res. 122 (2000) 11–17.
[5] Laporte, G., dan Palekar, U. Some applications of the clustered traveling salesman problem, J. Oper. Res. Soc. 53 (2002) 972–976.
[6] P. C. Pop. 2007. New Integer Programming Formulations of the Generalized Travelling Salesman Problem. American Journal of Applied Sciences 4 (11): 932-937, 2007, ISSN 1546-9239
[7] ______. 2012. Generalized Network Design Problems Modeling and Optimization. Boston: de Gruyter.
[8] ______., Kara, Imdat., dan A., H., Marc. 2011. New mathematical models of the generalized vehicle routing problem and extensions. :Elsevier. Applied Mathematical Modelling 36(2012) 97–107
[9] Susanna S. 2012. Discrete Mathematics with Application, 4th Edition. Boston, Amerika Serikat: DePaul University.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish in UJMC (Unisda Journal of Mathematics and Computer Science) agree to the following terms:
1.Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
2.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
3.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.