GHONI, SUKMA ABDUL (2025) PENENTUAN RUTE DISTRIBUSI PRODUKSI ROTI YANG OPTIMAL MENGGUNAKAN MODEL VEHICLE ROUTING PROBLEM (VRP) DENGAN METODE SAVING MATRIX PADA PT. XYZ. Skripsi thesis, Universitas Pancasakti Tegal.
![[img]](http://repository.upstegal.ac.id/style/images/fileicons/text.png) |
Text
cover-bab3.docx Download (852kB) |
|
Text
bab4_bab5.pdf Restricted to Repository staff only Download (1MB) |
|
Text
daftar pustaka_lampiran.pdf Download (1MB) |
Abstract
Permasalahan yang ada dalam transportasi adalah Vehicle Routing Problem (VRP) yaitu proses pengiriman produksi roti di PT. XYZ yang diketahui belum menggunakan sistem distribusi dengan rute yang optimal. Tujuan penulisan Skripsi ini adalah membentuk model Vehicle Routing Problem (VRP) untuk rute distribusi di PT XYZ, menyelesaikannya menggunakan metode saving matrix, nearest insert dan nearest neighbour. Metode saving matrix menggunakan nilai penghematan, metode nearest insert menambahkan titik baru ke rute yang sudah ada, kemudian metode nearest neighbour mempertimbangkan jarak paling dekat, berdasarkan perhitungan yang dilakukan menggunakan model VRP dengan metode saving matrix menghasilkan penghematan jarak 82,284 km, kemudian nearest insert menghasilkan penghematan jarak 93,829 km, dan nearest neighbor menghasilkan penghematan jarak paling besar yaitu 94,406 km, dengan rute kendaraan 1 yaitu Pabrik-Wonokerto-Pringlangu-Landungsari-Poncol-Pabrik, rute kendaraan 2 yaitu Pabrik-Grogol-Talang-Adiwerna-Slawi-Pabrik, rute kendaraan 3 yaitu Pabrik-Poso-Randugunting-Kraton-Pabrik, dan rute kendaraan 4 yaitu Pabrik-Mejasem-Kemantran-Brebes-Pabrik. Usulan rute distribusi mendapatkan penurunan terbesar yaitu 94,406 km dari yang awalnya jarak tempuh perusahaan sebesar 285,414 km kemudian didapatkan perhitungan presentase penghematan rute sebesar 33% dan akan menghemat biaya sebesar Rp. 235.284 dengan demikian rute optimal. Kata Kunci: Vehicle Routing Problem, Saving Matrix, Nearest Insert, Nearest Neighbor. ABSTRACT The problem that exists in transportation is the Vehicle Routing Problem (VRP), which is the process of delivering bread production at PT. XYZ is known to not use a distribution system with an optimal route. The purpose of writing this thesis is to form a Vehicle Routing Problem (VRP) model for distribution routes in PT XYZ, solving it using the saving matrix, nearest insert and nearest neighbour methods. The saving matrix method uses the saving value, the nearest insert method adds a new point to the existing route, while the nearest neighbour method considers the nearest distance, based on calculations made using the VRP model with the saving matrix method resulting in a distance saving of 82.284 km, then the nearest insert resulting in a distance saving of 93.829 km, and the nearest neighbor resulted in the largest distance saving, namely 94.406 km, with vehicle route 1 namely Factory-Wonokerto-Pringlangu-Landungsari-Poncol-Factory, vehicle route 2 namely Factory-Grogol-Talang-Adiwerna-Slawi-Factory, vehicle route 3 namely Factory-Poso-Randugunting-Kraton-Factory, and vehicle route 4, namely Factory-Mejasem-Kemantran-Brebes-Factory. The proposed distribution route received the largest decrease, namely 94,406 km from the initial company's mileage of 285,414 km, then a calculation of the route saving percentage of 33% was obtained and will save costs of Rp. 235,284 thus the optimal route. Keywords: Vehicle Routing Problem, Saving Matrix, Nearest Insert, Nearest Neighbor
| Item Type: | Karya Ilmiah (Skripsi) |
|---|---|
| Subjects: | T Technology > TD Environmental technology. Sanitary engineering |
| Divisions: | Fakultas Teknik dan Ilmu Komputer > Teknik Industri |
| Depositing User: | admin repository upstegal |
| Date Deposited: | 24 Mar 2025 02:37 |
| Last Modified: | 24 Mar 2025 02:37 |
| URI: | http://repository.upstegal.ac.id/id/eprint/10343 |
Actions (login required)
 |
View Item |