Penentuan pola distribusi optimal menggunakan metode saving matrix untuk meningkatkan fleksibilitas pemesanan

Winny Andalia, Devie Oktarini, Siti Humairoh

Abstract


The purpose of this study is to obtain the most appropriate and optimal cosmetic shipping routes that can minimize transportation distribution costs, and determining the magnitude of distribution cost savings. The object of this research is the distribution of Wardah Cosmetics in Palembang, and the study uses 7 retailers in Palembang. Analysis of determining the distribution route using the Saving Matrix Method. The results of the approach through the Nearest Insert, Nearest Neighbor and Sweep get the smallest value of the route along 73.6 Km. The analyzing results by using Saving Matrix Method determine the distribution route which can be converted from D1, D2, D3, D4, D5, D6, D7 into D3, D5, D6, D7, D1, D2, D4. The original mileage of 129 kilometers can be reduced to 73.6 kilometers, which means the distance can be shortened or more efficient by 55.4 kilometers. Route changes the result in lower product distribution costs. Initial transportation costs were Rp. 1.196.850 per day and subsequently getting down to Rp. 662.115 per day. Thus, the distribution channel cost savings of Rp. 534.735 per day.

Keywords


Saving Matrix Method, Distribution cost, Efficiency

Full Text:

PDF

References


A. E. Aboanber and A. A. Nahla, “Adaptive matrix formation (AMF) method of space-time multigroup reactor kinetics equations in multidimensional model,” Ann. Nucl. Energy, vol. 34, no. 1–2, pp. 103-119, 2007, doi: 10.1016/j.anucene.2006.07.012.

A. Yunitasari, “Optimalisasi Rute Pengangkutan Sampah di Kabupaten Sleman Menggunakan Metode Saving Matrix,”, Undergraduated Thesis, Fak. Mat. dan Ilmu Pengetahuan Alam, Univ. Negeri Yogyakarta, Yogyakarta, 2014.

I. Rizkya, N. Matondang, M. D. Yahya and M. S. Ningsih, "Design of Distribution Routes Using Saving Matrix Method to Minimize Transportation Cost," 2019 International Conference on Sustainable Engineering and Creative Computing (ICSECC), 2019, pp. 48-51, doi: 10.1109/ICSECC.2019.8907004.

H. I. Calvete, C. Galé, J. A. Iranzo, and P. Toth, "A matheuristic for the two-stage fixed-charge transportation problem," Computers & Operations Research, vol. 95, pp. 113-122, 2018, doi: 10.1016/j.cor.2018.03.007.

O. Cosma, P. C. Pop, D. Dănciulescu, "A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes," Computers & Operations Research, vol. 118, pp. 104906, 2020, doi: 10.1016/j.cor.2020.104906.

A. De, D. G. Mogale, M. Zhang, S. Pratap, S. K. Kumar, and G. Q. Huang, “Multi-period multi-echelon inventory transportation problem considering stakeholders behavioural tendencies,” International Journal of Production Economics, vol. 225, p. 107566, 2020, doi: 10.1016/j.ijpe.2019.107566.

F. D. Nasution, A. Momon, R. Fitriani, “Penentuan rute distribusi pallet mesh menggunakan metode saving matrix (Studi kasus: PT. MMM),” Jurnal Manajemen Industri dan Logistik, vol. 5, no. 1, pp. 1-9, 2021, doi: 10.30988/jmil.v5i1.542.

S. K. Roy and S. Midya, “Multi-objective fixed-charge solid transportation problem with product blending under intuitionistic fuzzy environment,” Applied Intelligence, vol. 49, no. 10, pp. 3524–3538, 2019, doi: 10.1007/s10489-019-01466-9.

S. K. Roy, S. Midya, and G.-W. Weber, “Multi-objective multi-item fixed-charge solid transportation problem under twofold uncertainty,” Neural Computing and Applications, vol. 31, no. 12, pp. 8593–8613, 2019, doi: 10.1007/s00521-019-04431-2.

S. A. Jalil, S. Javaid, and S. M. Muneeb, “A decentralized multi-level decision making model for solid transportation problem with uncertainty,” International Journal of System Assurance Engineering and Management, vol. 9, no. 5, pp. 1022–1033, 2018, doi: 10.1007/s13198-018-0720-2.

S. Suparmi, H. Suyitno, and I. Rosyida, “Pengoptimalan rute distribusi produk tisu di CV Maple Semarang dengan menggunakan metode saving matrix dan nearest insertion,” Unnes Journal of Mathematics, vol. 9, no. 2, pp. 49–57, 2020, doi: 10.15294/ujm.v9i2.37849.

V. A. Perdana, Z. F. Hunusalela, and A. T. Prasasty, “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, vol. 4, no. 2, pp. 91–105, 2021, doi: 10.30737/jatiunik.v4i2.1000.

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.

S. Suparjo, “Metode Saving Matrix Sebagai Alternatif Efisiensi Biaya Distribusi (Studi Empirik Pada Perusahaan Angkutan Kayu Gelondongan Di Jawa Tengah),” Media Ekonomi dan Manajemen, vol. 32, no. 2, 2017, doi: 10.24856/mem.v32i2.513.

B. Kurniawan et al., “Developing supply chain network with piecewise linear transportation cost for a small-and-medium enterprise (SME) in Cilegon,” Majalah Ilmiah Pengkajian Industri, vol. 15, no. 2, 2021, doi: 10.29122/mipi.v15i2.4819.

E. Supardi and R. C. Sianturi, “Metode saving matrix dalam penentuan rute distribusi premium di Depot SPBU Bandung,” Jurnal Logistik Bisnis, vol. 10, no. 1, pp. 89–98, 2020, doi: 10.46369/logistik.v10i1.844.




DOI: http://dx.doi.org/10.36055/jiss.v7i1.11378

Refbacks

  • There are currently no refbacks.


  is supported by