PENENTUAN RUTE DISTRIBUSI UNTUK MEMINIMALKAN BIAYA TRANSPORTASI MENGGUNAKAN METODE SAVING MATRIX DAN NEAREST INSERT (Studi Kasus PT. Xyz)

Penulis

  • Ridwan Hanif Program Studi Teknik Industri, Universitas Islam Batik Surakarta
  • Nancy Oktyajati Program Studi Teknik Industri, Universitas Islam Batik Surakarta
  • Diyah Dwi Nugraheni Program Studi Teknik Industri, Universitas Islam Batik Surakarta

Kata Kunci:

Routing,Transportation Cost, Nearest Insert, Saving Matrix, Distribution

Abstrak

In this era, the development ofptechnology has encouraged many companies to produce creative, innovative products, and strive to generate higher competitive value for their companies. determining the delivery route has several objectives to be achieved, for example to minimize shipping costs and time or distance traveled. The Saving Matrix methodlis a methodlused in determining product distribution routes to the marketinglarea by determininglthe distribution routes that must be passedlandlthe numberloflvehicles basedlon the capacity oflthe vehicle in orderlto obtain the shortest route and minimum transportation costs. PT. XYZ is a company engagedpin the sale of various needs for agriculture such as fertilizers, seeds and chemical drugs for agricultural production where every day must fulfill every order from customers. The purpose oflthis research is the need for a distribution system that can facilitate the delivery of time efficiency, precise in delivery, and provide the fastest route in the delivery of customer orders. Data collection is done by interviewin and observing the company. The data material was taken from October to November 2020. The results oflthe study obtained that the total distance traveled on the new route was 193.4 km and the total transportation cost was Idr.930,000, so that the method used can minimize the distance and costs traveled.

Referensi

Azizah, N., & Oesman, I. (2015). Optimalisasi Biaya Distribusi Produk PT. Madubaru dengan Pendekatan Metode Saving Matrix dan Generalized Assgnment. Jurnal Rekayasa dan InovasilTeknik Industri (REKAVASI), 3(2), 102-107.

Darmawan, A. (2011). Penentuan Rute Terpendek Pada Pengiriman AirlBersih dengan Menggunakan Metode Optimal. PKN. FT-UMM, Malang.

Demez, H. (2013). Optimasi Kombinatorial: Metode Solusi Traveling Salesman Problem. Tesis: Universitas Mediterania Timur.

Hayati, E. N. (2014). Supply Chain Management (SCM) dan Logistic Management. Jurnal Dinamika Teknik, Vol. 8 No. 1 Semarang : Universitas Stikubank.

Huda, K. (2014) Penentuan Rute Distribusi Untuk Meminimalkan Biaya Transportasi Menggunakan Metode Saving Matrix, Nearest Insert, Nearest Neighbor. Jurnal Jurusan Teknik Industri Fakultas Teknik Universitas Muhammadiyah Surakarta.

Indrawati, I. (2016). Determination ofpOptimal Routes on Garbage Transportation by Using Saving Matrix Method. In The 4th International Conference on Mathematical Sciences.

##submission.additionalFiles##

Diterbitkan

2022-06-15