OPTIMASI RUTE DISTRIBUSI MENGGUNAKAN ALGORITMA CLARKE AND WRIGHT SAVINGS DAN ALGORITMA NEAREST NEIGHBOR STUDI KASUS PETERNAKAN AYAM PETELUR ADI FARM

Riginianto, Radhinal Sa’id and Setiafindari, Widya (2024) OPTIMASI RUTE DISTRIBUSI MENGGUNAKAN ALGORITMA CLARKE AND WRIGHT SAVINGS DAN ALGORITMA NEAREST NEIGHBOR STUDI KASUS PETERNAKAN AYAM PETELUR ADI FARM. Tugas Akhir thesis, University of Technology Yogyakarta.

[img] Text
5200611129 Radhinal Sa_id Riginianto-ABSTRAK.pdf
Download (234kB)

Abstract

ABSTRAK Adi Farm merupakan salah satu peternakan ayam petelur. Dalam proses distribusi telur Peternakan Adi Farm menggunakan sarana transportasi berupa mobil Suzuki Carry pick up. Pendistribusian yang dilakukan tidak mempertimbangkan jarak tempuh dan waktu untuk mencapai titik-titik toko namun hanya berdasarkan intuisi dari supir dalam menentukan rute perjalanannya. Terdapat 11 pelanggan tetap dengan total jarak yang ditempuh sebesar 122,4 km dan biaya distribusi sebesar Rp 292.400. Berdasarkan permasalahan diatas dapat diselesaikan dengan menggunakan metode algoritma Clarke and Wright Saving dan Nearest Neighbor. Berdasarkan hasil perhitungan dengan metode algoritma Clarke and Wright Saving didapatkan hasil jarak 106,5 km dengan total biaya distribusi Rp 276.500. Sedangkan dengan metode algoritma Nearest Neighbor didapatkan hasil jarak 124,4 km dengan total biaya distribusi Rp 294.400. Dapat diketahui bahwa dengan metode algoritma Clarke and Wright Saving menghasilkan rute yang optimal dengan biaya distribusi yang minimum. Kata Kunci: Rute Distribusi, Clarke and Wright Saving, Nearest Neighbor ABSTRACT Adi Farm is a farm that raises laying hens. Adi Farm uses a Suzuki Carry pick-up car to transport eggs during distribution. The distribution does not consider the distance and time required to reach the shops and instead relies solely on the driver's intuition to determine the route. 11 regular customers have traveled a total distance of 122.4 km, resulting in a distribution cost of Rp 292,400. The mentioned issues can be resolved by utilizing the Clarke and Wright Saving and Nearest Neighbor algorithm techniques. According to the Clarke and Wright Savings algorithm calculation results, the distance is 106.5 km, and the total distribution cost is Rp 276,500. Using the Nearest Neighbor algorithm method results in a 124.4 km distance and a Rp 294,400 total distribution cost. The Clarke and Wright Saving algorithm method is observed to generate an optimal route with minimal distribution costs. Keywords: Distribution Route, Clarke and Wright Saving, Nearest Neighbor

Item Type: Thesis (Skripsi, Tugas Akhir or Kerja Praktek) (Tugas Akhir)
Subjects: T Technology > TS Manufactures
Divisions: Fakultas Sains dan Teknologi > S1 Teknik Industri
Depositing User: Kaprodi S1 Teknik Industri UTY
Date Deposited: 10 Dec 2024 04:19
Last Modified: 10 Dec 2024 04:19
URI: http://eprints.uty.ac.id/id/eprint/17196

Actions (login required)

View Item View Item
UTY Open Access is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.