ANALISIS PENENTUAN RUTE OPTIMAL DISTRIBUSI GAS LPG 3 KG MENGGUNAKAN METODE SAVING MATRIX DAN NEAREST NEIGHBOR (STUDI KASUS PT. RARIZA PUTRA)

Nandha Syafira Rosyadziba, NIM.: 18106060014 (2022) ANALISIS PENENTUAN RUTE OPTIMAL DISTRIBUSI GAS LPG 3 KG MENGGUNAKAN METODE SAVING MATRIX DAN NEAREST NEIGHBOR (STUDI KASUS PT. RARIZA PUTRA). Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

Preview	Text (ANALISIS PENENTUAN RUTE OPTIMAL DISTRIBUSI GAS LPG 3 KG MENGGUNAKAN METODE SAVING MATRIX DAN NEAREST NEIGHBOR (STUDI KASUS PT. RARIZA PUTRA)) 18106060014_BAB-I_IV-atau-V_DAFTAR-PUSTAKA.pdf - Published Version Download (2MB) | Preview
	Text (ANALISIS PENENTUAN RUTE OPTIMAL DISTRIBUSI GAS LPG 3 KG MENGGUNAKAN METODE SAVING MATRIX DAN NEAREST NEIGHBOR (STUDI KASUS PT. RARIZA PUTRA)) 18106060014_BAB-II_sampai_SEBELUM-BAB-TERAKHIR.pdf - Published Version Restricted to Registered users only Download (3MB) | Request a copy

Abstract

PT. Rariza Putra is a company engaged in the distribution of 3 kg Liquefied Petroleum Gas (LPG). The distribution is carried out starting from the LPG Bulk Filling Station (SPBE) and distributed to each customer base that has collaborated. In its distribution, the company determines the route only by forecasting made by the driver because the company does not yet have a fixed distribution route. Thus it does not guarantee that the resulting route is an optimal route. With the existing problems, PT. Rariza Putra requires a problem-solving method that will provide a solution in the form of a shorter route and will have an impact on the expenditure of fuel transportation costs. This research was conducted on the Vehicle Routing Problem (VRP) with the Capacited Vehicle Routing Problem (CVRP) approach, namely determining the route by taking into account the vehicle capacity, Vehicle Routing Problem with Multiple Trips (VRPMT), namely determining the route for each vehicle to make more than one delivery. and the Vehicle Routing Problem with Split Delivery (VRPSD) where each base may be visited more than once. The method used in solving this problem is the saving matrix and also the nearest neighbor, the two methods will be compared with the initial route that exists in the company and the method that gives the most optimal results is chosen. Based on the processing that has been carried out with both methods, the nearest neighbor method is chosen which gives more optimal results in determining the route and also affects the fuel costs incurred. The route generated by the nearest neighbor method in one week is 283.37 km with a comparison of the initial route length of 391.17 km. Meanwhile, the total savings in fuel costs incurred each week on the nearest neighbor method is Rp208,475 with a comparison of costs on the initial route of Rp289,773 with a difference of Rp81,298. From these results provide a percentage of savings of 28% compared to the initial results that exist in the company.

Share this knowledge with your friends :

Actions (login required)

View Item