PENYELESAIAN SPLIT DELIVERY VEHICLE ROUTING PROBLEM MENGGUNAKAN ALGORITMA ANT COLONY OPTIMIZATION Studi Kasus: Penentuan Rute Distribusi Air Mineral di Kabupaten Bandung

Regita Choirun Nisa, - (2023) PENYELESAIAN SPLIT DELIVERY VEHICLE ROUTING PROBLEM MENGGUNAKAN ALGORITMA ANT COLONY OPTIMIZATION Studi Kasus: Penentuan Rute Distribusi Air Mineral di Kabupaten Bandung. S1 thesis, Universitas Pendidikan Indonesia.

Baca Full Text klik disini
[img] Text
S_MAT_1908533_Title.pdf
Download (201kB)
[img] Text
S_MAT_1908533_Chapter1.pdf
Download (67kB)
[img] Text
S_MAT_1908533_Chapter2.pdf
Restricted to Staf Perpustakaan
Download (194kB)
[img] Text
S_MAT_1908533_Chapter3.pdf
Download (329kB)
[img] Text
S_MAT_1908533_Chapter4.pdf
Restricted to Staf Perpustakaan
Download (234kB)
[img] Text
S_MAT_1908533_Chapter5.pdf
Download (135kB)
[img] Text
S_MAT_1908533_Appendix.pdf
Restricted to Staf Perpustakaan
Download (242kB)
Official URL: https://repository.upi.edu

Abstract

Penelitian ini membahas Split Delivery Vehicle Routing Problem (SDVRP), yaitu masalah penentuan rute distribusi bagi kendaraan di mana pelanggan dapat dikunjungi atau dilayani oleh lebih dari satu kendaraan. Tujuan penyelesaian SDVRP adalah untuk menentukan rute pendistribusian dengan total jarak terpendek. Algoritma Ant Colony Optimization (ACO) digunakan untuk menyelesaikan permasalahan SDVRP. Cara kerja ACO diadaptasi dari proses semut mencari makan, yaitu bahwa setiap semut akan meninggalkan feromon sebagai sinyal bagi semut lainnya sehingga dapat menghasilkan rute terpendek ke sumber makanan. Algoritma ini bekerja dengan cara melakukan inisialisasi, mengonstruksi rute, memperbarui feromon dan evaluasi. Hasil implementasi model SDVRP dengan menggunakan ACO pada kasus pendistribusian air mineral suatu Perusahaan di Kabupaten Bandung menunjukkan bahwa ACO berhasil diimplementasikan dengan memberikan solusi yang cukup baik. Seluruh permintaan pelanggan dapat dipenuhi, di mana rute pendistribusian memuat split delivery dan mampu meminimumkan banyaknya kendaraan yang dibutuhkan untuk distribusi. : This research studies a Split Delivery Vehicle Routing Problem (SDVRP) emerging, that is a problem to determine distribution routes of vehicles, where customers can be served by more than one vehicle. The problem is solved to determine the distribution route with the shortest total distance. Ant Colony Optimization (ACO) algorithm is used to solve the problem. ACO is inspired by the foraging behavior of ants. At the core of this behavior is the indirect communication between the ants with the help of chemical pheromone trails, which enables them to find short paths between their nest and food sources. This algorithm works by initializing, constructing routes, updating pheromones, and evaluating. The computational results show that ACO can be well implemented for solving mineral water distribution problem and it gives good solutions. All demands can be fulfilled, where the distribution route includes split deliveries and it is able to minimize the number of vehicles needed for distribution.

Item Type: Thesis (S1)
Additional Information: ID SINTA Dosen Pembimbing: Khusnul Novianingsih: 258640 Cece Kustiawan: 6674760
Uncontrolled Keywords: Split Delivery, Ant Colony Optimization, Vehicle routing problem, Rute
Subjects: Q Science > QA Mathematics
Divisions: Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Jurusan Pendidikan Matematika > Program Studi Matematika (non kependidikan)
Depositing User: Regita Choirun Nisa
Date Deposited: 29 Dec 2023 09:50
Last Modified: 29 Dec 2023 09:50
URI: http://repository.upi.edu/id/eprint/113889

Actions (login required)

View Item View Item