PERBAIKAN RUTE DISTRIBUSI ES KRISTAL MENGGUNAKAN METODESWEEP DENGAN ALGORITMANEAREST NEIGHBOUR (Studi Kasus di PT. Eskimo Perdana Niaga)

Jati, Arif Rahmawan (2017) PERBAIKAN RUTE DISTRIBUSI ES KRISTAL MENGGUNAKAN METODESWEEP DENGAN ALGORITMANEAREST NEIGHBOUR (Studi Kasus di PT. Eskimo Perdana Niaga). Skripsi thesis, Universitas Setia Budi Surakarta.

	Text Intisari (Abstract).pdf Download (11kB)
	Text Skripsi (Arif Rahmawan Jati - 13130087E).pdf Download (5MB)

Abstract

PT.Eskimo is a crystal ice producer company located in Jati Beduk Wonogiri.The company has three cars used in the process of distributing ice crystals in the Wonogiri region, and each car is only capable of carrying a maximum of 120 bags of crystal ice plastic. The high demand and the number of customers then the company must be smart in managing the division of territory and distribution channels.The problem faced by the company today is in the determination of the distribution route that has not been efficient because it is not exactly the division of customer area that is in one region there are visited by the three cars so the authors are interested to make improvements to the distribution route. The purpose of this study is to determine the optimal route of crystal ice distribution to minimize the mileage so that it can minimize distribution cost at PT.Eskimo which is processed using Sweep Method with Nearest Neighbour Algorithm. Implementation of sweep method with Nearest Neighbour algorithm able to minimize the distance in crystal ice distribution in PT.Eskimo. Distance in one shipment of the initial route is 80,52 Km can be minimized to 70,36 km with a distance difference of 10,16 Km.The initial fuel consumption of the 8,6-liter route can be minimized to 7,51 liters. Total initial route distribution cost in one year is Rp 166.633.200 and distribution cost of proposed route in one year is Rp 160.570.620. The cost savings of distribution within one year reached Rp 6.062.580. Keyword : Distribution, Nearest Neighbour Method, Sweep Method, Vehicle Routing Problem

Item Type:	Thesis (Skripsi)
Uncontrolled Keywords:	Keyword : Distribution, Nearest Neighbour Method, Sweep Method, Vehicle Routing Problem
Subjects:	T Technology > T Technology (General)
Divisions:	Fakultas Teknik > Prodi S1 Teknik Industri
Depositing User:	Herera Gadys USB
Date Deposited:	22 Feb 2019 08:05
Last Modified:	22 Feb 2019 08:05
URI:	http://repo.setiabudi.ac.id/id/eprint/187

Actions (login required)

View Item