PENERAPAN METODE SAVING MATRIX DALAM PENENTUAN RUTE TERPENDEK PENGANGKUTAN SAMPAH DI KABUPATEN KUBU RAYA

Ikbal Muhaimin; Yundari Yundari; Meliana Pasaribu

doi:10.20527/epsilon.v17i1.8031

PENERAPAN METODE SAVING MATRIX DALAM PENENTUAN RUTE TERPENDEK PENGANGKUTAN SAMPAH DI KABUPATEN KUBU RAYA

Ikbal Muhaimin, Yundari Yundari, Meliana Pasaribu

Abstract

The process of transporting waste from the Waste Disposal Site (TPS) to the Final Disposal Site (TPA) is one of the problems in Kubu Raya district that needs attention. This is because the volume of waste in each TPS in Kubu Raya varies, and the number and capacity of transport vehicles provided by the PUPR Office of Kubu Raya is limited. Of course, these problems affect the distance traveled by the transport vehicle, travel time and costs incurred. Therefore, it is necessary to choose the optimal transportation route. The route is said to be optimal when each TPS is transported one way and does not exceed the capacity of the conveyance, so that the total distance obtained is the minimum total distance. The existing problems are then modeled in mathematical form and solved using the Saving Matrix method. This method combines destination points that can be traversed one way by paying attention to the volume of demand for each destination so as not to exceed the vehicle capacity. Based on the research results obtained four optimal vehicle routes with a total distance of 141.6 km. with details for the distance of vehicle route one which is 41.5 km, vehicle route two is 35.95 km, vehicle route three is 35.9 km, and vehicle route four is 28.25 km. This shows that the application of the Saving Matrix method provides more efficient results compared to the previous route of 162 km

Keywords

Distance, capacity, vehicle, nearest insert, nearest neighbor, volume

Full Text:

PDF

References

Agustine, Debby., Hadi, Ibnu. & Devi, Eka. (2022). Masalah Vehicle Routing Problem Pada Pengiriman Barang di kota Bandung utara dengan menggunakan Kluster KMeans dan Algoritma Nearest Neighbor. JMT : Jurnal Matematika dan Terapan. Vol.4(2),1-8.

Arifi, Rida. & Ahmad, Defri. (2019). Optimasi Rute Pengiriman Barang dengan Meminimumkan Biaya Transportasi Menggunakan Metode Saving Matrix di PT. Amanah Insanillahia. Fakultas Matematika Universitas Negeri Padang. Vol. 4(2), 43-48.

Basriati, Sri. & Sunarya, Rio. (2015). Optimasi Distribusi Koran Menggunakan Metode Saving Matriks (Studi Kasus: PT. Riau Pos Intermedia). Seminar Nasional Teknologi Informasi, Komunikasi dan Industri (SNTIKI) Jurusan Matematika Fakultas Sains dan Teknologi UIN Suska Riau, Pekanbaru 11 November.

Buako, Zulmagfir.,Yahya, Lailany. & Achmad, Novianita. (2021). Aplikasi Algoritma Floyd-Warshall Dengan Pendekatan Madm Dalam Menentukan Rute Terpendek Pengangkutan Sampah. Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi. Vol. 9(2), 62-70.

Cahyaningsih, Wahyu Kartika., Sari, Ratna. & Hernawati, Kuswari. (2015). Penyelesaian Capacitated Vehicle Routing Problem (Cvrp) Menggunakan Algoritma Sweep Untuk Optimasi Rute Distribusi Surat Kabar Kedaulatan Rakyat. Seminar Nasional Matematika Dan Pendidikan Matematika Uny. (pp. 1-8).

Indrawati.; Eliyati, Ning & Lukowi, Agus. (2016). Penentuan Rute Optimal pada Pengangkutan Sampah di Kota Palembang dengan Menggunakan Metode Saving Matrix. Jurnal Penelitian Sains. Vol.18(3), 105-110.

Kuka, Fatra.,Katili, Muhammad Rifai. & Payu, Muhammad Rezky Friesta. (2021). Pendekatan Goal Programming untuk Rute Pengangkutan Sampah. MUST: Journal of Mathematics Education, Science and Technology. Vol.6(1), 43-54.

Kurnia, Niken Septiana., Salsabila, Salwa., Sihobing, Sofia D.H., Kharisma, Intan Bunga., Anwar, Asep. (2021). Comparison Of Optimal Distribution Route For Personal Protection Equipment By Saving Matrix and Tabu Search Methods Using Nearest Neighbor Approach At Covid-19 Referral Hospitals In West Java. Turkish Journal of Computer and Mathematics Education. Vol (12)7, 2788-2797.

Rizwanullah, M. & Nilofer. (2018). Optimization of Vehicle Routine Problem of Using Saving Matrix Approach. Provided by International Institute for Science, Technology and Education (IISTE): E-Journals. Vol.8(7),8-16.

Rozi, Syamsyida. & Multahadah, Cut. (2021). Rute Terpendek Untuk Pengangkutan Sampah Dengan Pendekatan Lintasan Hamilton. E-Jurnal Matematika. Vol.10(2),115-121.

Siswanto. (2007). Operations Research. Jakarta: Erlangga.

Suyitno, Hardi.,Isnaini, Rosyida. & Suparmi. (2020). Pengoptimalan Rute Distribusi Produk Menggunakan Metode Saving Matrix Dan Nearest. UNNES Journal of Mathematics. Vol.9(2), 49-57.

Widyastiti, Maya. & Kamila, Isti. (2020). Model Vehicle Routing Problem Dalam Mengoptimumkan Rute Pengangkutan Sampah Di Kota Bogor. Jurnal Matematika, Statistika dan Komputasi. Vol. 16(2), 241-247.

Wijayanti, Supriyani., Prihandono, Bayu & Kusnandar, Dadan. (2015). Algoritma Dijkstra Untuk Mencari Lintasan Terpendek Dan Optimalisasi Kendaraan Pengangkut Sampah Di Kota Pontianak. Buletin Ilmiah Math, Stat, dan terapannya (Bimaster). Vol.4(3), 243-250.

DOI: https://doi.org/10.20527/epsilon.v17i1.8031