PERENCANAANRUTE DISTRIBUSI SARI ROTI DI PT BANGUN PUTRA KARAWANG MENGGUNAKAN METODE K-MEANS CLUSTERINGDAN NEAREST NEIGHBOR (STUDI KASUS : ALFAMIDIWILAYAH DKI JAKARTA) (TA 13.17.21.41)

Rafly, Ayodhia Muhammad and Purnama, Anggi Widya and Lestiani, Melia Eka (2021) PERENCANAANRUTE DISTRIBUSI SARI ROTI DI PT BANGUN PUTRA KARAWANG MENGGUNAKAN METODE K-MEANS CLUSTERINGDAN NEAREST NEIGHBOR (STUDI KASUS : ALFAMIDIWILAYAH DKI JAKARTA) (TA 13.17.21.41). Diploma thesis, STIMLOG INDONESIA.

[img] Text
3. BAB 1.pdf
Download (37kB)

Abstract

ABSTRAK PT Bangun Putra Karawang merupakan salah satu perusahaan logistik yang melayani pengiriman besar dari perusahaan, salah satunya adalah sebagai vendor untuk melakukan pengiriman produk dari PT Nippon Indosari atau Sari Roti. Saat ini rute pengiriman tersedia di beberapa wilayah pada pulau Jawa dan bali, salah satunya adalah ke DKI Jakarta. Untuk melayani pengiriman produk Sari Roti ke wilayah DKI Jakarta, PT Bangun Putra menggunakan mobil jenis Mitsubishi tipe FE71 sebanyak rata-rata 3 unit per hari. Pengiriman yang dilakukan oleh PT Bangun Putra Karawang terdapat beberapa permasalahan yaitu dari penentuan rute pengiriman hanya dilakukan berdasarkan pengemudi dan tidak memiliki ketetapan rute perusahaan. Oleh karena itu peneliti ingin melakukan penelitian menggunakan Periodic Capacitated Vehicle Routing Problem With Time Windows (PCVRPTW) dengan metode K-Means untuk mencari zona usulan dan metode Nearest Neighbor untuk mencari penentuan rute, dan menghitung perbandingan dalam aspek jarak tempuh, waktu pelayanan, total biaya pengiriman dan load factor menggunakan metode tersebut terhadap rute eksisting. Pada tahap pengolahan data dilakukan pengolahan dengan Algoritma Pillar dan K-Means untuk melakukan clustering titik antar yang memiliki jarak terdekat, kemudian melakukan penentuan rute menggunakan Nearest Neighbor agar solusi yang diperoleh dapat optimum. Waktu penelitian yang digunakan adalah 6 hari atau 3 siklus. Setelah dilakukan pengolahan data, maka dihasilkan sistem usulan memiliki nilai penghematan untuk jarak tempuh sebesar 878,9 Km atau 177%, penghematan waktu pelayanan sebesar 1244,72 menit atau 79%, penghematan total biaya pengiriman sebesar Rp. 2.047,433,68 atau sebesar 106%, dan untuk load factor didapat sebesar 1,00 atau sebesar 145,25%, Dari hasil pengolahan dan perhitungan tersebut didapatkan bahwa sistem usulan lebih mencapai nilai optimum daripada sistem eksisting yang diterapkan saat ini Kata Kunci : Algoritma Pillar, K- Means. Clustering Periodic Capacitated Vehicle Routing Problem With Time Windows (PCVRPTW), Nearest Neighbor. STIMLOG Indonesia vii ABSTRACT PT Bangun Putra Karawang is one of the logistics companies that serve large shipments from companies, one of which is as a vendor to make product delivery from PT Nippon Indosari or Sari Roti. Currently shipping routes are available in several regions on the islands of Java and Bali, one of which is to DKI Jakarta. To serve the delivery of Sari Roti products to the DKI Jakarta area, PT Bangun Putra uses Mitsubishi FE71 type cars as much as an average of 3 units per day. Delivery made by PT Bangun Putra Karawang there are several problems, namely from the determination of the delivery route only based on the driver and does not have the company's route determination. Therefore, researchers want to conduct research using Periodic Capacitated Vehicle Routing Problem With Time Windows (PCVRPTW) with the K-Means method to search the proposed zone and nearest neighbor method to find route determination, and calculate comparisons in aspects of mileage, service time, total shipping costs and load factor using these methods against existing routes. At the data processing stage, processing is done with Pillar and K-Means algorithms to cluster between points that have the closest distance, then determine the route using Nearest Neighbor so that the solution obtained can be optimal. The research time used is 6 days or 3 cycles. After processing the data, the proposed system has a saving value for mileage of 878.9 Km or 177%, service time savings of 1244.72 minutes or 79%, savings in total shipping costs of Rp. 2,047,433,68 or 106%, and the load factor is 1.00 or 145.25%. From the results of the processing and calculations, it is found that the proposed system achieves the optimum value more than the existing system currently applied. Keyword : Algoritma Pillar, K- Means. Clustering Periodic Capacitated Vehicle Routing Problem With Time Windows (PCVRPTW), Nearest Neighbor

Item Type: Thesis (Diploma)
Subjects: H Social Sciences > HE Transportation and Communications
Depositing User: Unnamed user with email [email protected]
Date Deposited: 22 Feb 2022 04:09
Last Modified: 22 Feb 2022 04:09
URI: http://eprint.ulbi.ac.id/id/eprint/62

Actions (login required)

View Item View Item
Repositori Stimlog is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.