UMM Institutional Repository

PENYELESAIAN PERMASALAHAN TRAVELLING SALESMAN PROBLEM WITH BACKHAUL UNTUK MEMINIMASI BIAYA TRANSPORTASI (Studi Kasus: Wiranas Laundry and Dry Cleaning Service)

RAHMASARI, DEWI (2014) PENYELESAIAN PERMASALAHAN TRAVELLING SALESMAN PROBLEM WITH BACKHAUL UNTUK MEMINIMASI BIAYA TRANSPORTASI (Studi Kasus: Wiranas Laundry and Dry Cleaning Service). Other thesis, University of Muhammadiyah Malang.

[img]
Preview
Text
jiptummpp-gdl-dewirahmas-37756-1-pendahul-n.pdf

Download (168kB) | Preview
[img]
Preview
Text
jiptummpp-gdl-dewirahmas-37756-2-babi.pdf

Download (163kB) | Preview

Abstract

Wiranas Laundry and Dry Cleaning Service adalah perusahaan yang bergerak dalam bidang jasa laundry dan dry cleaning. Dalam pelaksanaannya terdapat kendala yang dihadapi Wiranas Laundry and Dry Cleaning Service, yakni penentuan rute yang kurang efisien antara pelanggan yang diantar maupun pelanggan yang diambil barang laundrynya sehingga jarak tempuh kendaraan semakin jauh. Dari permasalahan tersebut diperlukan suatu metode guna mengatasi permasalahan tersebut. Dengan mengelompokkan jenis pelanggan menjadi pelanggan linehaul dan pelanggan backhaul diharapkan dapat memberikan keuntungan lebih kepada perusahaan. Pada tahap penentuan rute pengiriman dan pengambilan barang laundry, digunakan algoritma tabu search untuk mendapatkan rute yang efisien, sehingga biaya transportasi dapat diminimasi. Dari pengolahan data diperoleh total jarak usulan sebesar 59,20 km dan penghematan sebesar 5,22 km/hari dari rute awal, sedangkan perhitungan total biaya transportasi sebesar Rp 128.100,00 dan penghematan sebesar Rp 11.718,00/hari. ABSTRACT Wiranas Laundry and Dry Cleaning Service is a company engaged in the laundry and dry cleaning services. In their running business there are problems that Wiranas Laundry and Dry Cleaning Service faced, they are less efficient route for costumer with delivery service and for those with shuttle service, in such a way that the transportation cost can be minimize. Then they need a solution to solve the problem. It is by grouping costumer into linehaul and backhaul. Expectedly it can increase the company profit. The proposal method use taboo search algorithm to minimize the transportation cost by determining the route into delivery and shuttle service route. From the processing data obtained 59,20 km for total distance of proposal route. It means the company can minimize 5,22 km/day, it is more efficient than the previous route. While the calculation of the total transportation cost obtained Rp 128,100.00, it means the company can save of Rp 11718.00/day.

Item Type: Thesis (Other)
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Engineering > Department of Industrial Engineering (26201)
Depositing User: Mr Ahzen Habidin Muslim
Date Deposited: 07 Apr 2016 02:24
Last Modified: 07 Apr 2016 02:24
URI : http://eprints.umm.ac.id/id/eprint/25201

Actions (login required)

View Item View Item
UMM Official

© 2008 UMM Library. All Rights Reserved.
Jl. Raya Tlogomas No 246 Malang East Java Indonesia - Phone +62341464318 ext. 150, 151 - Fax +62341464101
E-Mail : infopus[at]umm.ac.id - Website : http://lib.umm.ac.id - Online Catalog : http://laser.umm.ac.id - Repository : http://eprints.umm.ac.id

Web Analytics

UMM Institutional Repository is powered by :
EPrints Logo