Penentuan Rute Optimal Distribusi Produk dengan Metode Traveling Salesman Problem (TSP) (Studi Kasus : PT. PPI Surakarta)

Setiyawan, Yudik and , Hafidh Munawir, S.T., M.Eng (2017) Penentuan Rute Optimal Distribusi Produk dengan Metode Traveling Salesman Problem (TSP) (Studi Kasus : PT. PPI Surakarta). Diploma thesis, Universitas Muhammadiyah Surakarta.

	PDF (Naskah Publikasi) revisi_NASPUB Scan 1-1-1.pdf Download (803kB)
	PDF (Halaman Depan) revisi_Halaman Depanu.pdf Download (970kB)
	PDF (Bab I) Bab I.pdf Download (192kB)
	PDF (Bab II) Bab II.pdf Restricted to Repository staff only Download (435kB) | Request a copy
	PDF (Bab III) Bab III.pdf Restricted to Repository staff only Download (117kB) | Request a copy
	PDF (Bab IV) Bab IV.pdf Restricted to Repository staff only Download (1MB) | Request a copy
	PDF (Bab V) Bab V.pdf Restricted to Repository staff only Download (81kB) | Request a copy
	PDF (Daftar Pustaka) Daftar Pustaka.pdf Download (41kB)
	PDF (Lampiran) Lampiran.pdf Restricted to Repository staff only Download (1MB) | Request a copy
	PDF (Surat Pernyataan Publikasi Ilmiah) Surat Pernyataan Publikasi Ilmiah (1).pdf Restricted to Repository staff only Download (299kB) | Request a copy

Abstract

PPI surakarta is a company wich has main activities,they are : export, import and distribution. In fact, there are many problems faced by the company, one of them is the determination of the optimum route in distributing the product to consumer. To achieve the purpose, the company use Traveling Salesman Problem (TSP) which consist of two methods, they are : Branch and Bound (BB) and Nearest Neighbor (NN). The main point of this method is the distance between one outlet to the other outlet which only visited once. To get the distance between outlet is by measuring each distances from storeroom, outlet to outlet and finaly come back to the storeroom. Those ways used on Monday to Friday. This reseach is expected to be useful as suggestion for the company in determining their product distribution route. The comparison result of using Branch and Bound and nearest neighbor method for Tuesday is as follow 6,84:5,06 km. On the other hand, it has been known that expense and the length of the distance passed in everydays and also the efficiency of the distance : Monday Rp 2.700,5 (4,91 Km; 34,46 %), Tuesday Rp 1.259,5 (2,29 Km; 31,16 %), Wednesday Rp 258,5 (0,47 Km; 5,32 %), Thursday Rp 1.639 (2,98 Km; 18,93 %), Friday Rp 148,5 (0,27 Km; 2,69 %). Therefore, we can save the expense Rp 312.312 in one fleet every year. It can be conclude that the method used to count the optimum route is Branch and Bound Method.

Item Type:	Karya ilmiah (Diploma)
Uncontrolled Keywords:	PT. PPI, Indonesian Trade Center (ITC), Traveling Salesman Problem, Branch and Bound, Nearest Neigbhor.
Subjects:	H Social Sciences > HC Economic History and Conditions
Divisions:	Fakultas Teknik > Teknik Industri
Depositing User:	Yudik Setiyawan
Date Deposited:	10 Nov 2017 01:46
Last Modified:	10 Nov 2017 01:48
URI:	http://eprints.ums.ac.id/id/eprint/57439

Actions (login required)

View Item