Product Delivery Distribution Route Design at UD. XYZ Use the Saving Matrix Method to Minimize Distribution Costs

##plugins.themes.academic_pro.article.sidebar##

Available on-line since Sep 15, 2022
https://doi.org/10.46574/motivection.v4i3.164
Download
PDF (Bahasa)
Statistic
Read Counter : 367
Download : 326
Vol 4 No 3 (2022): Motivection : Journal of Mechanical, Electrical and Industrial Engineering

##plugins.themes.academic_pro.article.main##

Asyifa Freda Salsa Billa
* Corresponding author: asyifafreda@student.telkomuniversity.ac.id
Program Studi Teknik Industri, Fakultas Rekayasa Industri, Universitas Telkom
Nova Indah Saragih
Program Studi Teknik Industri, Fakultas Rekayasa Industri, Universitas Telkom
Prafajar Suksessanno Muttaqin
Program Studi Teknik Industri, Fakultas Rekayasa Industri, Universitas Telkom

Abstract

One of the problems that frequently happen in distribution management is the Vehicle Routing Problem (VRP). VRP aims to create an optimal route, which has a minimum total distance to meet consumer demand. This problem is being experienced by UD. XYZ which causes cost overruns. The purpose of this study is to design product distribution routes to minimize distribution costs at UD. XYZ. The method used is a saving matrix with a dynamic program approach, nearest neighbor, and nearest insertion. Furthermore, the analysis of the sensitivity of the load and fuel is carried out. The saving matrix method with a dynamic program approach is able to reduce the distance traveled per week from 184.44 km to 136.65 km. In addition, the dynamic approach is also able to reduce distribution costs by 15.16% or Rp. 36,559.35 per week with distribution costs for the existing condition of Rp. 241.096.60 to Rp. 204.537.25.


Salah satu permasalahan yang sering dialami dalam manajemen distribusi adalah Vehicle Routing Problem (VRP). VRP bertujuan untuk membuat suatu rute yang optimal, yaitu memiliki total jarak minimum dalam memenuhi permintaan konsumen. Permasalahan ini sedang dialami oleh UD. XYZ yang menyebabkan pembengkakan biaya. Tujuan dari penelitian ini adalah merancang rute distribusi produk untuk meminimasi biaya distribusi pada UD. XYZ. Metode yang digunakan saving matrix dengan pendekatan program dinamis, nearest neighbor, dan nearest insertion. Selanjutnya dilakukan analisis sensitifitas muatan dan bahan bakar. Metode saving matrix dengan pendekatan program dinamis mampu memperkecil jarak tempuh per minggu yang semula 184,44 km menjadi 136,65 km. Selain itu pendekatan dinamis juga mampu menurunkan biaya distribusi sebesar 15,16% atau Rp36.559,35 per minggu dengan biaya distribusi kondisi saat ini Rp241.096,60 menjadi Rp204.537,25.

##plugins.themes.academic_pro.article.details##

License and Copyright
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Copyright (c): Asyifa Freda Salsa Billa, Nova Indah Saragih, Prafajar Suksessanno Muttaqin (2022)
How to Cite
Billa, A. F. S., Saragih, N. I., & Muttaqin, P. (2022). Product Delivery Distribution Route Design at UD. XYZ Use the Saving Matrix Method to Minimize Distribution Costs. MOTIVECTION : Journal of Mechanical, Electrical and Industrial Engineering, 4(3), 305-318. https://doi.org/10.46574/motivection.v4i3.164

References

[1] Novianti, A. N. Kamila, S. Febrianti, and M. Fauzi, “Penerapan Metode Saving Matrix Sebagai Program Pengurangan Biaya Distribusi Di Perusahaan Kosmestik,” J. Taguchi, vol. 1, no. 1, pp. 23–34, 2021, doi: https://doi.org/10.46306/tgc.v1i1.3.
[2] D. B. Paillin and F. M. Kaihatu, “Implementasi Metode Saving Matrix Dalam Penentuan Rute Terbaik Untuk Meminimumkan Biaya Distribusi (UD. Roti Arsita),” Arika, vol. 12, no. 2, pp. 123–140, 2018, doi: 10.30598/arika.2018.12.2.123.
[3] M. Yoana Putri and F. Fathorrahman, “Pengaruh Patronage Buying Motives Dan Promosi Gratis Ongkos Kirim Terhadap Keputusan Pembelian Di Shopee,” Distrib. - J. Manag. Bus., vol. 10, no. 1, pp. 105–116, 2022, doi: 10.29303/distribusi.v10i1.212.
[4] M. Reza Riansyah, B. Abdi Setiawan, A. Yusuf, and D. Maulina, “Penentuan Keputusan Rute Distribusi Terbaik Menggunakan Capacitated Vehicle Routing Problem (CVRP),” CSRID J., vol. 14, no. 1, p. 91, 2022, doi: http://dx.doi.org/10.22303/csrid.14.1.2022.%25p.
[5] A. Ferdiansyah, S. A. Sholihah, M. Rifni, E. S. Grets, J. K. Situmorang, and I. Oktaviany, “Analisis Perencanaan Rute Pengiriman Barang Menggunakan Metode Vehicle Routing Problem (VRP),” J. Sist. Transp. dan Logistik, vol. 1, no. 1, pp. 32–37, 2021, doi: http://dx.doi.org/10.54324/j.stl.v1i1.632.
[6] S. Suparjo, “Use of the saving matrix method as an alternative for distribution cost efficiency: An empirical study on log timber companies in Central Java,” Int. J. Sci. Technol. Res., vol. 8, no. 8, pp. 398–402, 2019.
[7] N. A. M and A. Susanty, “Optimalisasi Rute Distribusi Produk Portland Composite Cement (PCC) Dengan Menggunakan Metode Saving Matrix Untuk Meminimalkan Biaya Transportasi ( Studi Kasus : PT Indocement Tunggal Prakarsa , Tbk., Plant Cirebon ),” Ind. Eng. Online J., vol. 9, no. 2, 2020.
[8] T. R. Damayanti, A. L. Kusumaningrum, Y. D. Susanty, and S. S. Islam, “Route optimization using saving matrix method – a case study at public logistics company in indonesia,” Proc. Int. Conf. Ind. Eng. Oper. Manag., no. August, pp. 1583–1591, 2020.
[9] R. Saputra and D. Pujotomo, “Penyelesaian vehicle routing problem dengan karakteristik time windows dan multiple trips menggunakan metode saving matrix (Studi kasus : PT . Coca Cola Bottling Indonesia - Wilayah Medan),” Ind. Eng. Online J., vol. 7, no. 4, 2018.
[10] W. Andalia, D. Oktarini, and S. Humairoh, “Penentuan pola distribusi optimal menggunakan metode saving matrix untuk meningkatkan fleksibilitas pemesanan,” J. Ind. Serv., vol. 7, no. 1, p. 23, 2021, doi: 10.36055/jiss.v7i1.11378.
[11] Suparmi, H. Suyitno, and I. Rosyida, “Pengoptimalan Rute Distribusi Produk Tisu Di Cvmaple Semarang Dengan Menggunakan Metodesaving Matrix Dan Nearest Insertion,” Unnes J. Math., vol. 9, no. 2, pp. 49–57, 2020.
[12] L. Nissa, A. Mualifah, and D. Noviyanti, “Optimalisasi Jarak dan Biaya Transportasi Distribusi Obat PT Merapi Utama Pharma dengan Vehicle Routing Problem Metode Saving Matrix,” Pros. Semin. Nas. Pendidik. Mat. dan Mat., vol. 1, pp. 1–6, 2019, doi: https://doi.org/10.21831/pspmm.v1i0.17.
[13] S. M. Nugroho, L. Nafisah, M. S. A. Khannan, H. Mastrisiswadi, and M. N. Ramdhani, “Vehicle Routing Problem with Heterogeneous Fleet, Split Delivery, Multiple Product, Multiple Trip, and Time Windows: A Case study in fuel distribution,” IOP Conf. Ser. Mater. Sci. Eng., vol. 847, no. 1, 2020, doi: 10.1088/1757-899X/847/1/012066.
[14] R. Putrafi and A. Sahari, “Penyelesaian Vehicle Routing Problem Untuk Efisiensi Rute Pendistribusian Produk Minuman Teh Pucuk Harum Menggunakan metode Saving Matriks Studi Kasus (PT. Cipta Niaga Semesta Palu),” J. Ilm. Mat. Dan Terap., vol. 17, no. 1, pp. 17–28, 2020, doi: 10.22487/2540766x.2020.v17.i1.15164.
[15] T. J. Pattiasina, E. T. Setyoadi, and D. 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, 2018.
[16] M. Roohnavazfar and S. H. R. Pasandideh, Decomposition algorithm for the multi-trip single vehicle routing problem with AND-type precedence constraints, no. 0123456789. Springer Berlin Heidelberg, 2021.
[17] A. K. Pamosoaji, P. K. Dewa, and J. V. Krisnanta, “Proposed Modified Clarke-Wright Saving Algorithm for Capacitated Vehicle Routing Problem,” Int. J. Ind. Eng. Eng. Manag., vol. 1, no. 1, pp. 9–16, 2019, doi: 10.24002/ijieem.v1i1.2292.
[18] N. A. Fitriani, R. A. Pratama, S. Zahro, P. H. Utomo, and T. S. Martini, “Solving capacitated vehicle routing problem using saving matrix, sequential insertion, and nearest neighbor of product ‘X’ in Grobogan district,” AIP Conf. Proc., vol. 2326, 2021, doi: 10.1063/5.0039295.