Optimalisasi Rute Distribusi Ayam Potong Menggunakan Algoritma Clarke-Wright’s Savings Dengan Prosedur Pengurutan (Studi Kasus : Miami Chicken, Malang)

Fadhilah, Muhammad Rizqi (2019) Optimalisasi Rute Distribusi Ayam Potong Menggunakan Algoritma Clarke-Wright’s Savings Dengan Prosedur Pengurutan (Studi Kasus : Miami Chicken, Malang). Sarjana thesis, Universitas Brawijaya.

Abstract

Kegiatan distribusi adalah kegiatan pemasaran yang berusaha memperlancar dan mempermudah penyampaian barang dan jasa dari produsen kepada konsumen. Kegiatan distribusi ayam potong termasuk hal yang sangat penting dalam usaha makanan cepat saji, salah satunya Miami Chicken. Permasalahan dengan tujuan mendapatkan rute distribusi yang memiliki jarak tempuh terpendek termasuk pada tipe Vehicle Routing Problem. Vehicle Routing Problem (VRP) adalah permasalahan penentuan rute distribusi dari depot menuju beberapa pelanggan dengan memperhatikan batasan operasi. Salah satu cara menyelesaikan VRP adalah dengan menggunakan algoritma Clarke-Wright’s Savings. Pada penelitian ini menggunakan algoritma Clarke-Wright’s Savings yang didukung farthest insert, nearest insert, dan nearest neighbor. Tujuan dari penelitian ini adalah memperoleh rute terpendek menggunakan algoritma Clarke-Wright’s Savings dan mengukur performa farthest insert, nearest insert, dan nearest neighbor dalam penyelesaian rute distribusi ayam potong Miami Chicken. Hasil rute yang paling optimal diperoleh dari algoritma farthest insert sebesar 131,2 km lebih optimal 6,28% dibandingkan dengan rute awal.

English Abstract

Distributional activities are a marketing activity attempt to make the delivery system of goods and services from producers to consumers work fast and simple. Distribution of chickens are very important in the fast food industry, such as Miami Chicken. The problem which aim is obtaining the shortest distribution route included in the type of Vehicle Routing Problem. Vehicle Routing Problem (VRP) is a problem of determining the distribution route from the depot to several customers by observing the operating limits. One of the method to complete VRP is by using the Clarke-Wright's Savings algorithm. In this study using the Clarke-Wright's Savings algorithm supported by farthest insert , nearest insert, and nearest neighbor. The purpose of this study is to obtain the shortest route using the Clarke-Wright’s Savings algorithm and measure the farthest insert, nearest insert, and nearest neighbor performance in completing the distribution route of Miami Chicken. The most optimal route results obtained by the farthest insert algorithm of 131,2 km, 6,28% more optimal than initial route

Other obstract

-

Item Type:	Thesis (Sarjana)
Identification Number:	SKR/MIPA/2019/426/052001560
Uncontrolled Keywords:	distribusi, Vehicle Routing Problem, algoritma Clarke-Wright’s Savings, Farthest Insert, Nearest Insert, Nearest Neighbor. distribution, Vehicle Routing Problem, Clarke-Wright’s Savings Algorithm, Farthest Insert, Nearest Insert, Nearest Neighbor.
Subjects:	500 Natural sciences and mathematics > 518 Numerical analysis > 518.1 Algorithms
Divisions:	Fakultas Matematika dan Ilmu Pengetahuan Alam > Matematika
Depositing User:	Budi Wahyono Wahyono
Date Deposited:	05 Aug 2020 08:06
Last Modified:	08 Aug 2023 01:49
URI:	http://repository.ub.ac.id/id/eprint/179997

Text Muhammad Rizqi Fadhilah.pdf Download (3MB)

Actions (login required)

View Item