OPTIMASI RUTE PENGIRIMAN BARANG MENGGUNAKAN NEAREST NEIGHBOR PADA PERUSAHAAN HERBAL BERBASIS MOBILE

Jonathan Christoper Basuki, . (2026) OPTIMASI RUTE PENGIRIMAN BARANG MENGGUNAKAN NEAREST NEIGHBOR PADA PERUSAHAAN HERBAL BERBASIS MOBILE. Skripsi thesis, Universitas Pembangunan Nasional Veteran Jakarta.

[img] Text
ABSTRAK.pdf

Download (203kB)
[img] Text
AWAL.pdf

Download (876kB)
[img] Text
BAB I.pdf
Restricted to Repository UPNVJ Only

Download (360kB)
[img] Text
BAB II.pdf
Restricted to Repository UPNVJ Only

Download (438kB)
[img] Text
BAB III.pdf
Restricted to Repository UPNVJ Only

Download (1MB)
[img] Text
BAB IV.pdf
Restricted to Repository UPNVJ Only

Download (2MB)
[img] Text
BAB V.pdf

Download (235kB)
[img] Text
DAFTAR PUSTAKA.pdf

Download (209kB)
[img] Text
RIWAYAT HIDUP.pdf
Restricted to Repository staff only

Download (107kB)
[img] Text
LAMPIRAN.pdf
Restricted to Repository UPNVJ Only

Download (1MB)
[img] Text
HASIL PLAGIARISME.pdf
Restricted to Repository staff only

Download (19MB)
[img] Text
ARTIKEL KI.pdf
Restricted to Repository staff only

Download (436kB)

Abstract

The delivery route planning process for herbal beverage products at PT XYZ is currently performed manually based on the operational staff’s experience, which may result in inefficient routes and disregard customer operating time constraints. This study aims to design and implement a delivery route optimization system based on the Vehicle Routing Problem with Time Windows (VRPTW) using the Nearest Neighbor algorithm. The system was developed as an Android application integrated with a data processing pipeline consisting of geocoding using the Google Maps API, customer clustering, route optimization, performance evaluation, and result visualization through FastAPI. Testing on three delivery clusters demonstrated that the proposed approach was able to generate more efficient routes than the manual method. The average distance reduction achieved was 21.49%, with improvements of 15.79% in Cluster A1, 7.69% in Cluster H, and 30.00% in Cluster J. In addition, delivery times were reduced by approximately 20–25% across all tested routes. Functional testing of the Android application, consisting of 39 black-box testing scenarios and 24 User Acceptance Testing (UAT) scenarios, achieved a 100% success rate. The results indicate that the developed system effectively improves delivery efficiency and supports more optimal distribution operations.

Item Type: Thesis (Skripsi)
Additional Information: [No.Panggil: 2210511015] [Pembimbing 1: Ridwan Raafi’udin] [Pembimbing 2: Bambang Tri Wahyono] [Penguji 1: Jayanta] [Penguji 2: Anis Fitri Nur Masruriyah]
Uncontrolled Keywords: Distribution Route Optimization, Nearest Neighbor, Vehicle Routing Problem, Time Windows, Android Application
Subjects: Q Science > QA Mathematics > QA76 Computer software
T Technology > T Technology (General)
Divisions: Fakultas Ilmu Komputer > Program Studi Informatika (S1)
Depositing User: JONATHAN CHRISTOPER BASUKI
Date Deposited: 28 Aug 2026 06:15
Last Modified: 28 Aug 2026 06:15
URI: http://repository.upnvj.ac.id/id/eprint/52011

Actions (login required)

View Item View Item