OPTIMALISASI CAPACITATED VEHICLE ROUTING PROBLEM UNTUK PENENTUAN RUTE DISTRIBUSI MAKANAN RINGAN MENGGUNAKAN ALGORITMA SAVING MATRIX, NEAREST NEIGHBOUR, DAN SEQUENTIAL INSERTION DI PT. XYZ

Ruth Angieta, . (2025) OPTIMALISASI CAPACITATED VEHICLE ROUTING PROBLEM UNTUK PENENTUAN RUTE DISTRIBUSI MAKANAN RINGAN MENGGUNAKAN ALGORITMA SAVING MATRIX, NEAREST NEIGHBOUR, DAN SEQUENTIAL INSERTION DI PT. XYZ. Skripsi thesis, Universitas Pembangunan Nasional Veteran Jakarta.

[img] Text
ABSTRAK.pdf

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

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

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

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

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

Download (1MB)
[img] Text
BAB 5.pdf

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

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

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

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

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

Download (487kB)

Abstract

This study aims to enhance the operational efficiency of distribution at PT. XYZ through the optimization of fleet capacity and delivery routes. Demand forecasting using the Exponential Smoothing method achieved high accuracy with a Mean Absolute Percentage Error (MAPE) of 0.83345%, serving as a basis for estimating fleet capacity needs. Route optimization was carried out based on the Capacitated Vehicle Routing Problem (CVRP) approach, applying Saving Matrix, Nearest Neighbour, and Sequential Insertion algorithms. The results showed an increase in average fleet capacity utilization from 34% to 81–83%. Furthermore, the Sequential Insertion method produced the best outcomes, achieving a total travel distance of 653.23 km, a travel time of 28 hours 18 minutes, and a distribution cost of IDR 6,079,934, making it 40.85% more efficient than the existing route. The combination of forecasting and route optimization significantly improved distribution efficiency and Service Level Agreement (SLA) achievement. This study recommends the Sequential Insertion method as the optimal strategy for distribution planning at PT. XYZ.

Item Type: Thesis (Skripsi)
Additional Information: [No. Panggil: 2110312089] [Pembimbing: Muhamad As Adi] [Penguji 1: Yulizar Widiatama] [Penguji 2: Alina Cynthia Dewi]
Uncontrolled Keywords: Distribution Optimization, Demand Forecasting, Capacitated Vehicle Routing Problem, Sequential Insertion, Operational Efficiency
Subjects: H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
Q Science > QA Mathematics
T Technology > TS Manufactures
Divisions: Fakultas Teknik > Program Studi Teknik Industri (S1)
Depositing User: RUTH ANGIETA
Date Deposited: 08 Aug 2025 04:55
Last Modified: 08 Aug 2025 04:55
URI: http://repository.upnvj.ac.id/id/eprint/39146

Actions (login required)

View Item View Item