Azriel Fadhillah, . (2022) PERANCANGAN RUTE DISTRIBUSI PRODUK MENGGUNAKAN VRP DENGAN METODE SAVING MATRIX, SEQUENTIAL INSERTION, DAN NEAREST NEIGHBOUR DI PT. SEWU PRIMATAMA INDONESIA. Skripsi thesis, Universitas Pembangunan Nasional Veteran Jakarta.
![[img]](http://repository.upnvj.ac.id/style/images/fileicons/text.png) |
Text
ABSTRAK.pdf Download (36kB) |
|
Text
AWAL.pdf Download (395kB) |
|
Text
BAB 1.pdf Download (280kB) |
|
Text
BAB 2.pdf Restricted to Repository UPNVJ Only Download (443kB) |
|
Text
BAB 3.pdf Restricted to Repository UPNVJ Only Download (307kB) |
|
Text
BAB 4.pdf Restricted to Repository UPNVJ Only Download (1MB) |
|
Text
BAB 5.pdf Download (40kB) |
|
Text
DAFTAR PUSTAKA.pdf Download (97kB) |
|
Text
RIWAYAT HIDUP.pdf Restricted to Repository UPNVJ Only Download (104kB) |
|
Text
LAMPIRAN.pdf Restricted to Repository UPNVJ Only Download (1MB) |
|
Text
HASIL PLAGIARISME.pdf Restricted to Repository staff only Download (16MB) |
|
Text
ARTIKEL KI.pdf Restricted to Repository staff only Download (1MB) |
Abstract
PT. Sewu Primatama Indonesia is a hometown dairy distributor in Infinia Park, Manggarai, South Jakarta. So far, PT. SPI determines distribution routes only by classifying routes by region and does not consider mileage, travel time, and distribution costs. Based on these problems, researchers aim to determine the optimal distribution route using the Vehicle Routing Problem (VRP) with Saving Matrix, Sequential Insertion, and Nearest Neighbour methods. The Saving Matrix method determines the distribution route based on the greatest concentration value, and the Sequential Insertion method determines the distribution route by insertion into an existing route. In contrast, the Nearest Neighbour method considers the closest distance from each point. Based on the calculations in completing the VRP, the results of the Saving Matrix method cover a distance of 981.8 km, a travel time of 30 hours and 48 minutes, and require a cost of Rp. 3.460.707,00. The Sequential Insertion method covers a distance of 1019.6 km, the travel time is 32 hours and 35 minutes, and requires a fee of Rp. 3.610.547,00. While the Nearest Neighbour method covers a distance of 996 km, the travel time is 31 hours and 49 minutes and requires a fee of Rp. 3.537.800,00. This shows that the Saving Matrix method is the optimal method for determining the distribution route of PT. SPI.
| Item Type: | Thesis (Skripsi) |
|---|---|
| Additional Information: | [No.Panggil: 1910312035] [Pembimbing: Santika Sari] [Penguji 1: Reda Rizal] [Penguji 2: Nanang Alamsyah] |
| Uncontrolled Keywords: | Keywords : Saving Matrix, Sequential Insertion, Nearest Neighbour. |
| Subjects: | Q Science > QA Mathematics T Technology > TS Manufactures |
| Divisions: | Fakultas Teknik > Program Studi Teknik Industri (S1) |
| Depositing User: | Azriel Fadhillah |
| Date Deposited: | 01 Feb 2023 04:00 |
| Last Modified: | 01 Feb 2023 04:00 |
| URI: | http://repository.upnvj.ac.id/id/eprint/23076 |
Actions (login required)
 |
View Item |