VEHICLE ROUTING FOR RASKIN DISTRIBUTION IN PADANG PARIAMAN REGENCY

DILA, AMELIA AGUSTIN (2019) VEHICLE ROUTING FOR RASKIN DISTRIBUTION IN PADANG PARIAMAN REGENCY. Diploma thesis, Universitas Andalas.

Preview	Text (Cover dan Abstark) COVER DAN ABSTRAK.pdf - Published Version Download (148kB) | Preview
Preview	Text (BAB I (PENDAHULUAN)) BAB I (PENDAHULUAN).pdf - Published Version Download (482kB) | Preview
Preview	Text (BAB IV (PENUTUP)) BAB IV (PENUTUP).pdf - Published Version Download (111kB) | Preview
Preview	Text (DAFTAR PUSTAKA) DAFTAR PUSTAKA.pdf - Published Version Download (227kB) | Preview
	Text (Skripsi Full Text) TA FULL.pdf - Published Version Restricted to Repository staff only Download (2MB)

Abstract

Bulog Divre West Sumatera is operational Divre, which has two Subdivre, i.e. Subdivre Bukittinggi dan Subdivre Solok. Bulog Divre West Sumatera has five working areas, and these are Padang, Padang Pariaman, Pariaman, Pesisir Selatan, and Mentawai. Bulog Divre West Sumatera has a warehouse located in Bypass Pampangan. GBB Pampangan has a responsibility to distribute Raskin in Padang, Pariaman and Padang Pariaman. In Padang Pariaman Raskin distributed to 17 distribution point using three units of trucks with capacity 15 and 17 tons. Raskin distributed once a month during 6-7 days with the same interval, and total Raskin distributed is 196.150 kg/month. The research problem, Bulog Divre West Sumatera does not have a fixed vehicle route determination system to distribute Raskin. The previous route was determined based on vehicle capacity and the sequence customer to be visited determined based on the proximity of the distribution location according to salesman intuition. So, it causes long mileage and fuel cost. This problem known as the Vehicle Routing Problem, So, variant VRP used to solve this problem is the Capacitated Vehicle Routing Problem (CVRP). Capacitated Vehicle Routing Problem (CVRP) used to determine vehicle routes with minimum cost to serve a set of customers whose geographical coordinates with vehicle capacity as an additional constraint. CVRP problems can be solved using the Clarke-Wright Saving Algorithm. Then, sorting the route using the Nearest Neighbor method. Data collection includes primary data and secondary data. The data collected are Raskin demand data, Raskin distribution point data, distribution time, and the vehicle used to distribute Raskin in Padang Pariaman. Based on data processing, the proposed route using the Clarke and Wright Saving Algorithm method result in 16 distribution routes. The proposed route will be completed in 7 days using two units of trucks so that this proposed route can save the procurement cost for one vehicle. Besides, the proposed route using the Clarke and Wright Saving Algorithm method can save mileage by 6.5% with a travel time of 4634.35 minutes. It is shown that the proposed route can minimize distance and distribution time to optimize vehicle use. Keywords: CVRP (Capacitated Vehicle Routing Problem), Clarke-Wright Saving Algorithm Method, Nearest Neighbor

Actions (login required)

View Item