Optimasi Penentuan Rute Kendaraan Distribusi Produk Air Minum Kemasan Galon Menggunakan Kombinasi Algoritma Genetika Dan Pencarian Tabu Di Depot Air Minum Isi Ulang Banyu Belik, Purwokerto

Dini, Nisa Setya (2015) Optimasi Penentuan Rute Kendaraan Distribusi Produk Air Minum Kemasan Galon Menggunakan Kombinasi Algoritma Genetika Dan Pencarian Tabu Di Depot Air Minum Isi Ulang Banyu Belik, Purwokerto. Undergraduate thesis, Institut Technology Sepuluh Nopember.

[thumbnail of 5211100186-Undergraduate Thesis.pdf]
Preview
Text
5211100186-Undergraduate Thesis.pdf - Published Version

Download (2MB) | Preview

Abstract

Distribusi merupakan suatu proses memindahkan suatu barang
dari pemasok hingga ke pelanggan akhir. Akan tetapi pada
kenyataannya, proses pengiriman barang dari pemasok ke
pelanggan kurang memperhatikan biaya yang dikeluarkan, karena
tidak efisiennya rute pengiriman barang yang dilakukan. Masalah
ini sering disebut dengan Vehicle Routing Problem (VRP).
Depot Air Minum Isi Ulang (Damiu) Banyu Belik merupakan
sebuah depot yang sedang berkembang di Kabupaten Banyumas,
tetapi belum memperhatikan rute pengiriman, hanya berdasarkan
perkiraan dari pihak pengantar. Pengiriman dan pengambilan
galon yang tidak memperhatikan rute optimal hanya akan
menambah biaya pengiriman. Untuk meminimukan biaya yang
dikeluarkan dalam pengiriman dan pengambilan galon, perlu
meminimalkan armada kendaraan dan jumlah jarak perjalanan,
dengan batasan bahwa kendaraan harus memiliki kapasitas yang
cukup untuk mengangkut barang yang akan dikirim dan
mengambil barang pada pelanggan untuk mengembalikan barang
ke depot.
vi
Metode yang digunakan untuk optimasi rute pengiriman barang
dalam studi kasus Depot Air Minum Banyu Belik adalah metode
kombinasi algoritma genetika dan pencarian tabu. Algoritma
genetika memiliki kelebihan memberikan kemungkinan solusi yang
banyak sedangkan pencarian tabu menutupi kekurangan dari
algoritma genetika yang kurang mampu dalam pengidentifikasian
solusi lokal sehingga proses pencarian mengalami pengulangan
pada daerah solusi yang sama.
Hasil uji coba menunjukkan bahwa penentuan rute menggunakan
algoritma genetika dan pencarian tabu lebih efisien dibandingkan
rute awal yang telah ditentukan Depot Banyu Belik.
=========================================================================================================
Distribution is a process of moving the goods from the supplier to
customers. But in fact, the delivery of goods from supplier to
customers less attention to the costs incurred, due to the inefficient
delivery route is performed. This problem is often called the
Vehicle Routing Problem (VRP).
Banyu Belik Water Refill Depot is a depot that is growing in
Banyumas, but not attention to the delivery route, just based on
estimates of the delivery man. Delivery and retrieval of galons that
do not attention to the optimal route would only add to the cost of
shipping. For minimum costs incurred in the delivery and retrieval
galon, it is necessary to minimize the vehicle fleet and the amount
of travel distance, with the restriction that the vehicle must have
sufficient capacity to transport the goods to be shipped and take
the goods to the customers to return the goods (empty galon) to the
depot.
The method used for optimization of the delivery route in this
observation is combination of genetic algorithm and tabu search.
Genetic algorithms have advantages provide possible solutions to
the many taboos while searching shortfall of genetic algorithms
viii
that are less capable in identifying local solutions so the algorithm
search process into a loop in the area of the same solution.
Experimental results show that the determination of the genetic
algorithm and tabu search is more efficient than a predetermined
route beginning from Banyu Belik Depot.

Item Type: Thesis (Undergraduate)
Additional Information: RSSI 005.1 Din o
Uncontrolled Keywords: Vehicle Routing Problem with Pick-up and Delivery, Rute, Optimasi, Algoritma Genetika, Pencarian Tabu.
Subjects: H Social Sciences > HE Transportation and Communications > HE336.R68 Route choice
Q Science > QA Mathematics > QA402.5 Genetic algorithms.
Divisions: Faculty of Information Technology > Information System > 57201-(S1) Undergraduate Thesis
Depositing User: Mr. Tondo Indra Nyata
Date Deposited: 03 Jul 2019 07:46
Last Modified: 03 Jul 2019 07:46
URI: http://repository.its.ac.id/id/eprint/63438

Actions (login required)

View Item View Item