PERBANDINGAN ALGORITMA SAVING MATRIX DAN SEQUENTIAL INSERTION PADA PENGOPTIMALAN MASALAH RUTE KENDARAAN BERKAPASITAS

Fajar Pangestu, NIM.: 18106010023 (2022) PERBANDINGAN ALGORITMA SAVING MATRIX DAN SEQUENTIAL INSERTION PADA PENGOPTIMALAN MASALAH RUTE KENDARAAN BERKAPASITAS. Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

Preview	Text (PERBANDINGAN ALGORITMA SAVING MATRIX DAN SEQUENTIAL INSERTION PADA PENGOPTIMALAN MASALAH RUTE KENDARAAN BERKAPASITAS) 18106010023_BAB-I_IV-atau-V_DAFTAR-PUSTAKA.pdf - Published Version Download (2MB) | Preview
	Text (PERBANDINGAN ALGORITMA SAVING MATRIX DAN SEQUENTIAL INSERTION PADA PENGOPTIMALAN MASALAH RUTE KENDARAAN BERKAPASITAS) 18106010023_BAB-II_sampai_SEBELUM-BAB-TERAKHIR.pdf - Published Version Restricted to Registered users only Download (4MB) | Request a copy

Abstract

Distribution is the activity of sending product from the production of a factory to customers as consumers using transport vehicles. By doing the right distribution of product can be more profitable for various parties. Because with proper distribution it can minimize costs, efficient delivery times and customers can be fulfilled according to their requests. In order to distribute products properly, vehicle route distances must be minimized. The problem of minimizing vehicle routes is called the Vehicle Routing Problem (VRP). One of the variants of VRP is the Capacitated Vehicle Routing Problem (CVRP), which means that there are capacity constraints on the transport vehicles. After obtaining the optimal route, then the Vehicle Routing Problem with Multiple Trips (VRPMT) is applied to determine the required number of transport vehicles. In this study, CVRP will be applied using the Saving Matrix Algorithm and Sequential Insertion Algorithm to determine the optimal route for UMKM Keripik Usus Mbak Zul. After being applied to UMKM Keripik Usus Mbak Zul, the results obtained from the Saving Matrix Algorithm resulted in a distance of 174 km, with a requirement of 3.48 liters of pertalite fuel equivalent to a price of IDR 34,800 and the distribution took 388 minutes or 6.47 hours. As for completing the route with the Sequential Insertion Algorithm, it produces a distance of 188.4 km, with a requirement of 3.77 liters of pertalite fuel equivalent to a price of IDR 37,700 and the distribution takes 408 minutes or 6.8 hours. The results of the calculations for each of these algorithms require one vehicle for distribution. So, it can be concluded that in the case of product distribution from UMKM Keripik Usus Mbak Zul, the Saving Matrix Algorithm is more optimal than the Sequential Insertion Algorithm.

Share this knowledge with your friends :

Actions (login required)

View Item