Penentuan Rute Distribusi Es Kristal Di Pt. Es Kristal Menggunakan Algoritma Clarke And Wright Savings Dan Nearest Neighbour (Studi Kasus: Pt. Es Kristal)

Rifa'i, Ahmad Bahtiar and , Hari Prasetyo, ST.,MT.,Ph.D (2019) Penentuan Rute Distribusi Es Kristal Di Pt. Es Kristal Menggunakan Algoritma Clarke And Wright Savings Dan Nearest Neighbour (Studi Kasus: Pt. Es Kristal). Skripsi thesis, Universitas Muhammadiyah Surakarta.

	PDF (Naskah Publikasi) naskah publikasiku.pdf Download (1MB)
	PDF (Halaman Depan) HALAMAN DEPAN.pdf Download (917kB)
	PDF (Bab I) BAB I.pdf Download (103kB)
	PDF (Bab II) BAB II.pdf Restricted to Repository staff only Download (359kB) | Request a copy
	PDF (Bab III) bab III.pdf Restricted to Repository staff only Download (327kB) | Request a copy
	PDF (Bab IV) BAB IV.pdf Restricted to Repository staff only Download (577kB) | Request a copy
	PDF (Bab V) BAB V.pdf Restricted to Repository staff only Download (89kB) | Request a copy
	PDF (Daftar Pustaka) DAFTAR PUSTAKA.pdf Download (162kB)
	PDF (Lampiran) LAMPIRAN.pdf Restricted to Repository staff only Download (353kB) | Request a copy
	PDF (Pernyataan Publikasi Ilmiah) SURAT PERNYATAAN ilmiah.pdf Restricted to Repository staff only Download (218kB) | Request a copy

Abstract

Abstract Vehicle Routing Problem (VRP) is better known as model determination on the route. Optimal route determination for problems that use more than one fleet to serve customers who have certain capacities according to their respective requests. One form of VRP is CVRP(Capacitated Vehicle Routing Problem), which is that each fleet has the same and limited capacity that distributes each customer's request to the largest agent by minimizing mileage. One example of CVRP's problem is crystal ice distribution at PT. Solo Ice Crystal. The purpose of this study is to compare the distribution system and distribution costs at PT. Es Kristal uses the Clarke And Wright Savings algorithm and the nearest neighbor algorithm. Minimizing distance and cost by choosing the fastest route is the Clarke And Wright Savings algorithm method. The nearest neighbor method is the method used to determine visits by prioritizing the location closest to the last visit. A possible way to obtain a particular route is to consider the capacity of each fleet and the demand of each customer with an algorithm. The data needed in this study is the number of customer requests, distance data between customers, data distance between depots and customers, and capacity data on vehicles. Based on the analysis of data processing that has been done obtained savings on the BB, DD. And II amounted to 122.78 km and savings in transportation costs of Rp. 106,409.00. Keywords: Clarke and Wright Saving Method, CVRP (Capacitated Vehicle Routing Problem), Method Nearest neighbor

Item Type:	Karya ilmiah (Skripsi)
Uncontrolled Keywords:	Clarke and Wright Saving Method, CVRP (Capacitated Vehicle Routing Problem), Method Nearest neighbor
Subjects:	Q Science > Q Science (General) Q Science > QA Mathematics
Divisions:	Fakultas Teknik > Teknik Industri
Depositing User:	AHMAD BAHTIAR RIFA'I
Date Deposited:	16 May 2019 02:41
Last Modified:	16 May 2019 02:41
URI:	http://eprints.ums.ac.id/id/eprint/73092

Actions (login required)

View Item