OSPTIMASI RUTE DISTRIBUSI SAYURAN PADA HOTEL UNTUK MEMINIMALKAN BIAYA DAN EFISIENSI JARAK DENGAN MENGGUNKAN METODE SAVING MATRIKS, NEAREST NEIGHBOUR DAN NEAREST INSERT

Authors

  • Risqila Nur Aziz Universitas Teknologi Yogyakarta
  • Andung Jati Nugroho Universitas Teknologi Yogyakarta

DOI:

https://doi.org/10.61722/jmia.v3i1.8062

Keywords:

Distribution; Insertion, Neighbor, Saving Matrix

Abstract

Vegetable distribution is an important activity that directly affects cost efficiency and delivery timeliness, particularly in small and medium-scale enterprises. A common problem faced is the determination of distribution routes that are not yet optimal, resulting in longer travel distances and higher distribution costs. This research was conducted at UMKM Supplier Slamet Sayur, located in Pasar Gede, Surakarta City, which distributes vegetables to several hotels in the Solo area. The purpose of this study is to determine the most efficient distribution route by minimizing travel distance and distribution costs. The methods applied in this study are Saving Matrix, Nearest Neighbor, and Nearest Insertion. Distance data between distribution points were processed to generate proposed routes and then compared with the existing distribution route based on total distance and distribution cost. The results show that the existing route has a travel distance of 59.9 km with a monthly distribution cost of IDR 3,934,000. After optimization, the Saving Matrix method resulted in a distance of 53 km with a cost of IDR 3,796,000, the Nearest Neighbor method produced the shortest distance of 47.6 km with a cost of IDR 3,688,000, while the Nearest Insertion method resulted in a distance of 49.2 km with a cost of IDR 3,720,000. Based on these results, it can be concluded that the Nearest Neighbor method is the most efficient and feasible method for improving vegetable distribution performance at UMKM Supplier Slamet Sayur

References

Anisa Permatasari, D. (2024) ‘Industri Inovatif-Jurnal Teknik Industri ITN Malang, Maret 2024 Implementasi Metode Saving Matrix Dan Nearest Neighbor | Diah | Lukmandono implementasi metode saving matrix dan nearest neighbor untuk meningkatkan efektivitas dan efisiensi rute’, pp. 101–106.

Ariyanto, D. & Suseno (2023) ‘Optimalisasi Penentuan Rute Distribusi Roti Bakar Dengan Metode Saving Matrix Dan Algoritma Nearest Neighbor Pada Pabrik Roti Bakar Azhari’, Jurnal Ilmiah Teknik Industri Dan Inovasi, 2(1), pp. 1–11. Available at: https://doi.org/10.59024/jisi.v2i1.494.

Chandrahadinata, D., Taptajani, D.S. & Fathori, M.Z. (2025) ‘Perancangan Rute Pengangkutan Sampah di Garut Dengan Model Penyelesaian Capacitated Vehicle Routing Problem (CVRP)’, Jurnal Kalibrasi, 23(1), pp. 117–125. Available at: https://doi.org/10.33364/kalibrasi/v.23-1.1897.

Emaputra, A. & Maulana, K.A. (2022) ‘Penentuan Jalur Distribusi Gas LPG dengan Metode Savings Matrix dan Nearest Neighbor pada PT. XYZ’, Jurnal Rekayasa Industri (JRI), 4(2), pp. 94–103. Available at: https://doi.org/10.37631/jri.v4i2.634.

Faiz, A.N. (2025) ‘Optimasi Rute Pendistribusian Barang untuk Minimasi Jarak Tempuh dan Biaya Transportasi dengan Metode Nearest Insert : Studi Kasus di UMKM XYZ Optimizing Goods Distribution Routes To Minimize Travel Distance And Transportation Costs Using The Nearest Insert’, 10(02).

Hanafie, A. & Syarifuddin, R. (2022) ‘Makassar Kearea Distribusi Dengan Metode Saving Matrix’, 03(02), pp. 48–54.

Hanif, R., Oktyajati, N. & Dwi Nugraheni, D. (2022) ‘penentuan rute distribusi untuk meminimalkan biaya transportasi menggunakan metode savingimatrix dan nearest insert, pp. 35–46. Available at: http://journal.uniba.ac.id/index.php/jrts/article/view/275.

Lati, G.M., Faber, S. & Simanjuntak, T. (2023) ‘Penerapan Saving Matrix Untuk Meminimalisir Biaya Dan Menentukan Rute Pick Up Paket Mitra Korporat Di PT Pos Indonesia (Persero) Kantor Cabang Pematang Siantar’, Jurnal Logistik Bisnis, 13(2), pp. 25–34. Available at: https://ejurnal.ulbi.ac.id/index.php/logistik/.

Muhammad A.S. (2024) ‘Optimasi Jalur Distribusi Pada Umkm Mitra Telur Dengan Menggunakan Metode Saving Matrix Dan Nearest Neighbor’, Jurnal Ilmiah Sains Teknologi Dan Informasi, 2(2), pp. 29–38. Available at: https://doi.org/10.59024/jiti.v2i2.724.

Pratiwi, M. & Lubis, R.S. (2023) ‘Distribution Route Optimization Using Nearest Neighbor Algorithm and Clarke and Wright Savings’, Sinkron, 8(3), pp. 1638–1652. Available at: https://doi.org/10.33395/sinkron.v8i3.12622.

Rahmania, S.N.A., Wahyuda, W. & Gunawan, S. (2023) ‘Penentuan Rute Distribusi Barang Menggunakan Vehicle Routing Problem (Studi Kasus: CV. Surya Inti Distrindo)’, INTECOMS: Journal of Information Technology and Computer Science, 6(2), pp. 578–585. Available at: https://doi.org/10.31539/intecoms.v6i2.6816.

Rahmawati, T.S., Istifarrosa, W. & Tampubolon, Y.M. (2023) ‘Determining Newspaper Distribution Routes to Reduce Environmental Emissions with Saving Matrix Method Based on Demand Forecasting for Green Logistics’, pp. 2811–2823. Available at: https://doi.org/10.46254/an12.20220522.

Safitri, K.N., Fole, A. & ’Aini, N. (2025) ‘Optimalisasi Rute Distribusi Peralatan Elektronik: Inovasi Metode Saving Matrix dan Nearest Neighbor’, Jurnal Teknik Ibnu Sina (JT-IBSI), 10(1), pp. 87–98. Available at: https://doi.org/10.36352/jt-ibsi.v10i1.1179.

Siraj, H. & Hibatulloh, A. (2025) ‘Penentuan Rute Optimal Distribusi Air Minum Isi Ulang Di Gerai Afsheena Dengan Menggunakan’, 2(2), pp. 860–871.

Sitorus, E., Wibowo, A., Herlina, R., & Setiafindari, W. (2022). Upaya Peminimalan Biaya Distribusi Dengan Merencanakan Rute Pengiriman Menggunakan Metode Saving Matrix. Jurnal Aplikasi Ilmu Teknik Industri (JAPTI), 3(2), 71-83

Supriatna, D., Ciptaningtyas, D. & Supangkat, S. (2022) ‘Optimasi Jalur Distribusi Sayuran Daun Segar menggunakan Metode Saving Matriks (Studi Kasus: Keboen Bapak)’, Jurnal Ilmiah Rekayasa Pertanian dan Biosistem, 10(2), pp. 213–225. Available at: https://doi.org/10.29303/jrpb.v10i2.419.

Yetrina, M. & Nainggolan, D.S. (2021) ‘Penentuan Rute Distribusi Untuk Meminimasi Biaya Distribusi di UKM Habil Snack’, Jurnal Teknologi Dan Sistem Informasi Bisnis, 3(1), pp. 247–253. Available at: https://doi.org/10.47233/jteksis.v3i1.221.

Ginting, A.F. (2024) ‘Analisis Penentuan Rute Distribusi Optimal Dalam Pendistribusian Ikan Mas Dengan Metode Saving Matriks’.

Gusminto, E.B. & Lesmana, R.P. (2023) ‘Optimalisasi Rute untuk Meminimalkan Biaya Pengangkutan Sampah di Kota Jember menggunakan Metode Saving Matrix oleh Dinas Lingkungan Hidup Kabupaten Jember’, Jurnal Ekonomi Akuntansi dan Manajemen, 22(2), p. 148. Available at: https://doi.org/10.19184/jeam.v22i2.38579.

Jihad Azhar, F.(2023) ‘Penentuan Rute Terbaik Pada Distribusi Produk X Di Pt Bcd Menggunakan Metode Saving Matrix Dan Nearest Neighbors’, Jurnal Ilmiah Teknik dan Manajemen Industri, 3(1), pp. 702–712.

Muhayyaroh, N., Siswanto, B.N. & Dewi, N.K. (2023) ‘Perancangan Sistem Penentuan Rute Dan Optimasi Biaya Pendistribusian Barang Dengan Metode Saving Matrix Dan Nearest Insertion Berbasis Vba Excel’, Jurnal Pabean.,5(2),pp.146–159.Availableat: https://doi.org/10.61141/pabean.v5i2.423

Nadya, Y., Sabardi, W., & Rivai, M. (2023). Penentuan Rute Distribusi Penjualan Tahu Menggunakan Metode Algoritma Clarke & Wright Saving Untuk Meminimumkan Biaya Distribusi (Studi Kasus: UD. Sekar Sari, Kab. Aceh Tamiang). Jurnal Industri Samudra, 4(1), 1-12.

Nazar, Z.H. (2021) ‘Penentuan Rute Optimal Pengangkutan Sampah Menggunakan Metode Clarke & Wright Saving Matrix, Nearest Neighbor, Nearest Insert, Dan Farthest Insert (Studi Kasus: Dinas Lingkungan Hidup Kota Yogyakarta)’. Uin Sunan Kalijaga Yogyakarta.

Rhamdani, J.N., Fadurahman Munigar, N. (2023) ‘Analisis Rute Dan Biaya Pada Distribusi Produk Benang Di Pt Spmi Dengan Menggunakan Metode Saving Matrix’, Jurnal Ilmiah Teknik dan Manajemen Industri, 3(1), pp. 2023–103.

Rhamdani, J. N., Munigar, N. F., Untari, N. D., & Fauzi, M. (2023). Analisis Rute Dan Biaya Pada Distribusi Produk Benang Di Pt Spmi Dengan Menggunakan Metode Saving Matrix. Jurnal Ilmiah Teknik dan Manajemen Industri, 3(1), 103-111.

Rifa’i, A.B. & Hari Prasetyo, S.T. (2019) ‘Penentuan Rute Distribusi Es Kristal Di Pt. Es Kristal Menggunakan Algoritma Clarke And Wright Savings Dan Nearest Neighbour (Studi Kasus: Pt. Es Kristal)’. Universitas Muhammadiyah Surakarta.

Salsabila, A.A. & Dewi, N.K. (2021) ‘Optimasi Rute Terpendek Dari Pengambilan Biji Kopi Yang Berbentuk Cherry Pada Endemix Nusantara Dengan Menggunakan Metode A lgoritma Genetika (Ta 13.16. 21.35)’. Stimlog Indonesia

Downloads

Published

2026-01-02

Issue

Section

Articles