Penerapan Metode Saving Matrix Dan Algoritma Nearest Neighbor Dalam Menentukan Rute Distribusi Untuk Meminimalkan Biaya Transportasi Pada PT. XYZ

Authors

  • Viva Arfana Perdana Program Studi Teknik Industri, Fakultas Teknik dan Ilmu Komputer, Universitas Indraprasta PGRI
  • Zeny Fatimah Hunusalela Program Studi Teknik Industri, Fakultas Teknik dan Ilmu Komputer, Universitas Indraprasta PGRI
  • Aliffia Teja Prasasty Program Studi Teknik Industri, Fakultas Teknik dan Ilmu Komputer, Universitas Indraprasta PGRI

DOI:

https://doi.org/10.30737/jatiunik.v4i2.1000

Keywords:

Distribution, Saving Matrix, Nearest Neighbor, Transportation Cost

Abstract

PT. XYZ is a business entity engaged in the production of mineral water. In the distribution process, the company still has an obstacle that is an unstructured shipping scheme that causes waste of transportation costs in some areas.  This problem is caused by limited vehicle facilities so that the distance traveled for delivery of goods is longer. This study uses Saving Matrix method and nearest neighbor algorithm calculation of the phenomenon, this research was conducted to analyze distribution costs to be more efficient. neighbor. The result of this study is the company's distribution cost data of Rp. 18,940,924/month after done the cost of distribution into and with saving matrix method and Nearest Neighbor algorithm so save 16% which is Rp. 16.302.392 / month from the initial cost proposed from the company.


PT. XYZ meruapakan sebuah badan usaha yang bergerak di bidang produksi air mineral. Di dalam proses distribusinya, perusahaan ini masih memiliki sebuah kendala yaitu skema pengiriman yang tidak terstruktur yang menyebabkan pemborosan biaya transportasi di beberapa daerah.  Permasalahan ini di sebabkan oleh fasilitas kendaraan yang terbatas sehingga jarak yang ditempuh untuk pengiriman barang semakin panjang. Penelitian ini menggunakan metode Saving Matrix dan perhitungan algoritma Nearest Neighbor Dari fenomena tersebut, penelitian ini dilakukan untuk melakukan analisa biaya distribusi agar lebih efrisien. neighbor. Hasil dari penelitian ini adalah data biaya distribusi perusahaan sebesar Rp. 18.940.924/bulan setelah dilakukan biaya distribusinya menjadi serta dengan metode Saving Matrix dan algoritma Nearest Neighbor jadi lebih menghemat 16% yaitu sebesar Rp. 16.302.392 / bulan dari biaya awal yang diusulkan dari perusahaan.

References

P. Pujiyanto, “Jiwa Entrepreneurship Penggerak Desain,†ANDHARUPA J. Desain Komun. Vis. Multimed., vol. 4, no. 02, pp. 239–251, 2018, doi: 10.33633/andharupa.v4i02.1966.

N. Susanti and M. Sahli, “PENERAPAN METODE EXPONENTIAL SMOOTHING DALAM SISTEM INFORMASI PENGENDALIAN PERSEDIAAN BAHAN BAKU (STUDI KASUS TOKO TIRTA HARUM),†Simetris J. Tek. Mesin, Elektro dan Ilmu Komput., 2013, doi: 10.24176/simet.v3i1.89.

A. K. Garside, “Manajemen Logistik,†Univ. Muhammadiyah Malang., 2017.

R. Kurniawan, “Analisis Kinerja Distribusi Logistik Pada Pasokan Barang dari PT . Surya Pamenang ke Konsumen,†JURMATIS J. Ilmial Mhs. Tek. Ind., vol. 1, no. 1, pp. 0–13, 2019.

S. Hudori, M., & Madusari, “Penentuan Rute Angkutan Tandan Buah Segar (Tbs) Kelapa Sawit Yang Optimal Dengan Metode Saving Matrix.,†J. Citra Widya Edukasi, vol. 9, no. 1, pp. 25–39., 2017.

arie restu Wardhani, “Perencanaan agregat dengan metode transportasi pada pt. x pasuruan,†Widya Tek., vol. 18, no. 1, pp. 6–10, 2010.

Y. Yusriadi, “Pengaruh Bauran Pemasaran (Marketing Mix) Terhadap Loyalitas Konsumen Pada Restoran Cepat Saji O’Chicken Di Pekanbaru,†J. Ilm. Ekon. Dan Bisnis, vol. 15, no. 1, pp. 71–77, 2018, doi: 10.31849/jieb.v15i1.1032.

L. D. Simbolon, M. Situmorang, and N. Napitupulu, “Aplikasi Metode Transportasi dalam Optimasi Biaya Distribusi Beras Miskin (Raskin) pada Perum BULOG Sub Divre Medan,†saintia Mat., vol. 2, no. 3, pp. 299-311., 2014.

E. K. Morlok, Pengantar Teknik dan Perencanaan Transportasi. 1991.

A. M. Majid, P. Moengin, and A. Witonohadi, “USULAN PENERAPAN TOTAL PRODUCTIVE MAINTENANCE (TPM) DENGAN PENGUKURAN OVERALL EQUIPMENT EFFECTIVENESS (OEE) UNTUK PERENCANAAN PERAWATAN PABRIK BAR MILL PADA PT. KRAKATAU WAJATAMA,†J. Tek. Ind., 2014, doi: 10.25105/jti.v4i3.1515.

D. . Pattiasina, T. J., Setyoadi, E. T., & Wijayanto, “Saving matrix method for efficient distribution route based on google maps API,†J. Telecommun. Electron. Comput. Eng., vol. 10, no. 2–3, pp. 183–188, 2008.

A. Supriyadi, S., Mawardi, K., & Nalhadi, “Minimasi Biaya Dalam Penentuan Rute Distribusi Produk Minuman Menggunakan Metode Savings Matrix.,†Pros. Semin. Nas. Ris. Ter. SENASSET, no. (pp. 1-8), 2017.

M. Amri, A. Rahman, and R. Yuniarti, “Penyelesaian Vehicle Routing Problem dengan Menggunakan Metode Nearest Neighbor,†J. Rekayasa dan Manaj. Sist. Ind., vol. 2, no. 1, pp. 36–45, 2014.

R. N. Devita, H. W. Herwanto, and A. P. Wibawa, “Perbandingan kinerja metode naive bayes dan k-nearest neighbor untuk klasifikasi artikel berbahasa indonesia.,†JTIIK (Jurnal Teknol. Inf. dan Ilmu Komputer), vol. 5, 2018.

S. Martono and H. L. H. S. Warnars, “Penentuan Rute Pengiriman Barang Dengan Metode Nearest Neighbor,†Petir J. Pengkaj. dan Penerapan Tek. Inform., vol. 13, no. 1, pp. 44–57, 2020.

A. Sutoni and I. Apipudin, “Optimalisasi Penentuan Rute Distribusi Pupuk Untuk Meminimalkan Biaya Transportasi Dengan Metode Saving Matrix.,†Spektrum Ind., vol. 17, no. 2, pp. 143–155, 2019.

M. A. W. MOCHAMAD ARIF WIBOWO, “PENENTUAN RUTE DISTRIBUSI AMDK MENGGUNAKAN PENDEKATAN HEURISTIC PADA CAPACITATED VEHICLE ROUTING PROBLEM,†2019.

A. Komari and H. B. Santoso, “Analisis Waktu Lampu Hijau, Kapasitas Kendaaran dan Derajat Jenuh di Simpang Empat Bersinyal.,†JATI UNIK J. Ilm. Tek. dan Manaj., vol. 3.1: 55-64, 2019.

N. Dzikrulloh, “Penerapan Metode K–Nearest Neighbor (KNN) Dan Metode Weighted Product (WP) Dalam Penerimaan Calon Guru Dan Karyawan Tata Usaha Baru Berwawasan Teknologi,†(Doctoral dissertation, Universitas Brawijaya)., 2017.

N. D. Mentari, M. A. Fauzi, and L. Muflikhah, “Analisis Sentimen Kurikulum 2013 Pada Sosial Media Twitter Menggunakan Metode K-Nearest Neighbor dan Feature Selection Query Expansion Ranking.,†J. Pengemb. Teknol. Inf. dan Ilmu Komput., 2018.

Downloads

PlumX Metrics

Published

2021-03-31

How to Cite

Arfana Perdana, V., Fatimah Hunusalela, Z., & Teja Prasasty, A. (2021). Penerapan Metode Saving Matrix Dan Algoritma Nearest Neighbor Dalam Menentukan Rute Distribusi Untuk Meminimalkan Biaya Transportasi Pada PT. XYZ. JATI UNIK : Jurnal Ilmiah Teknik Dan Manajemen Industri, 4(2), 91–105. https://doi.org/10.30737/jatiunik.v4i2.1000

Issue

Vol. 4 No. 2 (2021): April

Section

Articles

License

Information regarding Copyright and Licensing at JATI UNIK as follows:

  1. Licensed Use of Non - Commercial Articles will be governed by the Creative Commons Attribution license, which is featured on the Creative Commons Attribution Non-Commercial Share A Like 4.0 International License.
  2. The author guarantees that the articles published through JATI UNIK are original and do not contain statements that violate the law do not violate others' rights are subject to copyright, which is held exclusively by the author and free from the rights of third parties. The author is allowed to quote from various sources used for research and not to harm any party.
  3. JATI UNIK disseminates articles published with the rules set by Creative Commons. UNIK JATI license allows users to copy, distribute, display, and work for non-commercial purposes. Users also need to connect authors and JATI UNIK with the distribution of articles in journals.
  4. The Author rights, namely copyrights, ownership rights, patents, rights to use the substance of articles in the future, rights to reproduce articles for personal purposes and not to be traded, rights to conduct personal archives, rights to contract used for the non-exclusive distribution of articles published in the form a book and acknowledge the initial publication of the article originating from JATI UNIK.
  5. Suppose articles published by the author through JATI UNIK are compiled with other authors. In that case, it is necessary to create a form containing the authority of all authors involved in the article's production by including the agreement agreed upon by all authors in the article.
  6. The next point is, the agreement can be terminated if the author or JATI UNIK violates the agreement and cannot make repairs to the customer within a maximum of 2 months after being given information asking for the violation to be corrected. If there is no violation of the agreement, the license will automatically terminate and affect UNIQUE JATI UNIK.
  7. Regarding royalties, so far, if it is following applicable legal regulations, the author will waive his right to collect royalties on articles that have been licensed by JATI UNIK.
  8. In publishing the article, the editorial process is successful. JATI UNIK will continue it. JATI UNIK has the right to adjust articles related to punctuation, spelling, capital letters, references used, and usage adapted to JATI UNIK. The author acknowledges that the article can be published and accessed free of charge by the public.