Analisa Optimasi Rute Transportasi Antar Jemput Siswa Menggunakan Model CGVRP dan Algoritma Dijkstra di SDIT Darus Sunnah

  • Koko Hermanto Universitas Teknologi Sumbawa
  • Tita Dwi Ermayanti Universitas Teknologi Sumbawa
DOI: https://doi.org/10.52166/ujmc.v5i2.1653
Keywords: CGVRP method, Dijkstra Algorithm, shortest route, SDIT Darus Sunnah

Abstract

School transportation is one of the facilities provided by the school in the process of picking up students. In the process of picking up, taking the optimal route is needed to save costs and time. The purpose of this study is to develop a model School transportation routes using the Clustered Generalized Vehicle Routing Problem (CGVRP ) model and the Dijkstra algorithm to get a more optimal route from the route that has been used. Furthermore, comparing the real distance from the shuttle transportation routes with the distance from the results of this case study using the CGVRP model and the Dijkstra algorithm. From the research results obtained by using the CGVRP model and the Djikstra algorithm which is applied to the case study of shuttle students at Darus Sunnah SDIT We found that our result has shorter distance when compared to the distance of the usual route.. The total distance on the SDIT Darus Sunnah route is 2.746.416 meters and costs Rp. 2.214.288 in a month. While the distance from the proposed route obtained 2.333.616 meters for at Rp. 1.881.478 in a month. Therefore the difference in the distance from the real route and the proposed route is 357.288 meters with a difference in cost of Rp. 332.820, - in a month.

References

[1] Hermanto, K., & Ruskartina, E. 2017. Usulan Rute Optimal Distribusi Sampah Shift I Kota Sumbawa Besar Menggunakan Metode GVRP. Eigen Mathematics Journa. 1(2):7-12.
[2] Hermanto, K., & Ruskartina, E. 2017. Optimasi Rute Truk Pengangkutan Sampah Di Kota Sumbawa Besar Shift II Menggunakan GVRP. Jurnal UJMC.4(2):15-23.
[3] Munir, Rinaldi. 2005. “Matematika Diskrit”. Bandung: Informatika Bandung.
[4] Petrica, POP.2011.A New Efficient Transformation Of The Generalized Vehicle Routing Problem Into The Classical Vehicle Routing Problem”.Jurnal Riset Operasi.North University of Baia Mare.Romania.
[5] Jek Siang, Jong.2014.”Riset Operasi Pada Pendekatan Algoritmis”. Yogyakarta: Penerbit Andi.
Published
2019-12-31
How to Cite
Hermanto, K., & Ermayanti, T. (2019). Analisa Optimasi Rute Transportasi Antar Jemput Siswa Menggunakan Model CGVRP dan Algoritma Dijkstra di SDIT Darus Sunnah. UJMC (Unisda Journal of Mathematics and Computer Science), 5(2), 19 - 28. https://doi.org/https://doi.org/10.52166/ujmc.v5i2.1653
Issue
Vol 5 No 2 (2019): Unisda Journal of Mathematics and Computer science
Section
Articles
Creative Commons License

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.