MODEL HETEROGENEOUS FLEET CAPACITATED VEHICLE ROUTING PROBLEM (HFCVRP) UNTUK OPTIMASI RUTE DISTRIBUSI PAKAN TERNAK (STUDI KASUS: DIVISI DISTRIBUSI, KJUB PUSPETASARI, KLATEN)

Muhammad Ari Wijayanto, NIM.: 21106060022 (2025) MODEL HETEROGENEOUS FLEET CAPACITATED VEHICLE ROUTING PROBLEM (HFCVRP) UNTUK OPTIMASI RUTE DISTRIBUSI PAKAN TERNAK (STUDI KASUS: DIVISI DISTRIBUSI, KJUB PUSPETASARI, KLATEN). Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

Preview	Text (MODEL HETEROGENEOUS FLEET CAPACITATED VEHICLE ROUTING PROBLEM (HFCVRP) UNTUK OPTIMASI RUTE DISTRIBUSI PAKAN TERNAK (STUDI KASUS: DIVISI DISTRIBUSI, KJUB PUSPETASARI, KLATEN)) 21106060022_BAB-I_IV-atau-V_DAFTAR-PUSTAKA.pdf - Published Version Download (4MB) | Preview
	Text (MODEL HETEROGENEOUS FLEET CAPACITATED VEHICLE ROUTING PROBLEM (HFCVRP) UNTUK OPTIMASI RUTE DISTRIBUSI PAKAN TERNAK (STUDI KASUS: DIVISI DISTRIBUSI, KJUB PUSPETASARI, KLATEN)) 21106060022_BAB-II_sampai_SEBELUM-BAB-TERAKHIR.pdf - Published Version Restricted to Registered users only Download (8MB) | Request a copy

Abstract

Every company that produces goods needs an efficient distribution system to distribute them. Based on direct observation at KJUB Puspetasari, the delivery process is completely left to each driver without direction regarding the order of delivery that must be followed. This practice creates potential inefficiencies. Therefore, this study develops a mathematical model of Mixed Integer Linear Programming (MILP) in a vehicle fleet problem that has different types and capacities, known as Heterogeneous Fleet Capacitated Vehicle Routing Problem (HFCVRP), with the help of CPLEX Solver software. The model was developed with the objective to minimize the total distance of different vehicle fleets in the product distribution process. The results showed that the proposed route for fleet 1(1) experienced savings of 3,38%, with the total distance reduced from 529,7 km to 511,8 km. Fleet 1(2) showed savings of 2,40%, from 516,4 km to 504 km. Fleet 1(3) showed savings of 6,15%, from 518,4 km to 486,5 km. Meanwhile, fleet 1(4) experienced no change in total distance, indicating that the existing route was optimal. Fleet 1(5) showed savings of 2,36%, from 465,5 km to 454,5 km and fleet 2 shows a saving of 1,72% with a reduced distance from 465,3 km to 457,3 km. With a total savings from the entire fleet of 81,2 km and an average for all fleets of 2,67%. Overall, these results prove that the proposed route successfully reduces the distance traveled and increases efficiency in the distribution process and has the potential to reduce logistics costs in the long run.

Share this knowledge with your friends :

Actions (login required)

View Item