Widyasta, Ivan Cahya (2018) Penerapan Metode Saving Matrix Pada Vehicle Routing Problems Multiple Depots Dalam Pendistribusian Sari Apel PT. MKP. Sarjana thesis, Universitas Brawijaya.
Abstract
PT. Manasatria Kusumajaya Perkasa (PT. MKP) adalah perusahaan yang memproduksi sari apel dan sari buah dalam berbagai macam kemasan gelas. PT. MKP menggunakan jasa pengiriman barang untuk mendistribusikan produk ke masing-masing cabangnya. Masalah yang kerap terjadi pada proses pendistribusian tersebut adalah tidak dimaksimalkannya kapasitas angkut armada truk dalam proses pendistribusian serta rute pendistribusian produk masing-masing armada pengiriman hanya berdasarkan kepada satu titik tujuan saja. Sistem seperti ini dirasa kurang efisien karena mengeluarkan biaya yang tinggi terutama ketika jumlah permintaan masing-masing cabang perusahaan meningkat secara signifikan. Penelitian ini terfokus pada penentuan rute pendistribusian supaya mendapatkan total jarak tempuh dan biaya pendistribusian yang paling minimum. Pada penelitian ini dilakukan perhitungan matrik jarak dan matrik penghematan antara depot dengan cabang serta antar masing-masing cabang perusahaan. Setelah mendapatkan hasil matrik jarak dan matrik penghematan dilakukan pengalokasian masing-masing cabang ke dalam rute berdasarkan matrik penghematan yang telah didapatkan sebelumnya. Selanjutnya dilakukan pengurutan titik cabang untuk setiap rute yang terbentuk dengan menggunakan metode nearest neighbor dan farthest insert. Setelah itu dipilih antara kedua metode tersebut yang menghasilkan rute pendistribusiaan dengan total jarak tempuh terpendek untuk kemudian dilakukan perhitungan biaya pengiriman berdasarkan rute pendistribusian metode usulan terpilih. Langkah terakhir adalah membandingkan total jarak tempuh dan total biaya pendistribusian dari metode yang digunakan dengan sistem dan strategi pendistribusian existing perusahaan. Sebelumnya, perusahaan memiliki 11 rute pendistribusian. Dari hasil penelitian, didapatkan 3 hingga 5 rute pendistribusian optimal tergantung dari banyaknya jumlah permintaan. Analisa dan perhitungan dengan metode saving matrix dan nearest neighbor menghasilkan total jarak tempuh dan total biaya pendistribusian yang lebih kecil dibandingkan dengan total jarak tempuh dan total biaya pendistribusian yang dihasilkan dengan kebijakan perusahaan saat ini. Pada penelitian ini diketahui bahwa terjadi penghematan jarak tempuh pendistribusian sebesar 44,66% serta penghematan biaya pendistribusian sebesar 40,85% apabila dibandingkan dengan metode pendistribusian existing yang dilakukan perusahaan saat ini.
English Abstract
PT. Manasatria Kusumajaya Perkasa (PT. MKP) is a company that produce apple extract and fruit extract in many varies of packaging glass which employ delivery services to distribute their products. Problems that occur in this distribution process are that delivery fleet’s capacity is not used by its maximum capacity and they distribute the products using one fleet for one company branch only. This strategy is considered not efficient especially when product demands from all subsidiaries are increasing significantly. This study focusing on determination of distribution route with minimum distribution distance calculation and minimum distribution cost. In this study, researcher calculating distance matrix and saving matrix between depot and each of company branchs. After getting the results of distance matrix and saving matrix, researcher allocating each of company branchs into route based on saving matrix that obtained before. After that, researcher sorting the sequence of distribution destination for every route that obtained by using nearest neighbor and farthest insert method. Afterwards, researcher choose which method between nearest neighbor and farthest insert that produce the least distribution lenght route to calculate distribution cost afterward. The last step is comparing the result of distribution lenght and distribution cost between proposal method and distribution lenght distance and distribution cost by using existing method by company. Previously, company has 11 distribution routes. From this study, there are 3 up to 5 distribution routes obtained depends on product demand. Analysis and calculation by using saving matrix and nearest neighbor method generate smaller distribution lenght distance and distribution cost compared by distribution lenght distance and distribution cost obtained from company policy that currently do. In this study noted that distribution lenght distance savings occured as big as 44,66% and distrubtion cost savings as much as 40,85% if compared by existing distribution method that company currently run.
| Item Type: | Thesis (Sarjana) |
|---|---|
| Identification Number: | SKR/FT/2018/580/051806915 |
| Uncontrolled Keywords: | Rute Distribusi, Saving Matrix, Nearest Neighbor Distribution Route, Saving Matrix, Nearest Neighbor |
| Subjects: | 600 Technology (Applied sciences) > 658 General management > 658.5 Management of production > 658.53 Sequencing |
| Divisions: | Fakultas Teknik > Teknik Industri |
| Depositing User: | Budi Wahyono Wahyono |
| Date Deposited: | 24 Jun 2019 02:02 |
| Last Modified: | 25 Oct 2021 02:46 |
| URI: | http://repository.ub.ac.id/id/eprint/162882 |
Preview |
Text
KELENGKAPAN.pdf Download (709kB) | Preview |
Preview |
Text
DAFTAR PUSTAKA.pdf Download (653kB) | Preview |
Preview |
Other
LEMBAR PENGESAHAN.PDF Download (507kB) | Preview |
Preview |
Text
Ivan Cahya Widyasta.pdf Download (2MB) | Preview |
Preview |
Text
BAB I.pdf Download (904kB) | Preview |
Preview |
Other
LEMBAR ORISINALITAS.PDF Download (496kB) | Preview |
Preview |
Text
BAB II.pdf Download (1MB) | Preview |
Preview |
Text
BAB III.pdf Download (681kB) | Preview |
Preview |
Text
BAB IV.pdf Download (1MB) | Preview |
Preview |
Text
COVER.pdf Download (430kB) | Preview |
Preview |
Text
BAB V.pdf Download (643kB) | Preview |
Actions (login required)
 |
View Item |