IMPLEMENTASI ALGORITMA IMPROVED ANT COLONY OPTIMIZATION UNTUK MENYELESAIKAN CAPACITATED DYNAMIC VEHICLE ROUTING PROBLEM

Nabila Amelia Putri, - (2024) IMPLEMENTASI ALGORITMA IMPROVED ANT COLONY OPTIMIZATION UNTUK MENYELESAIKAN CAPACITATED DYNAMIC VEHICLE ROUTING PROBLEM. S1 thesis, Universitas Pendidikan Indonesia.

Baca Full Text klik disini
[img] Text
S_MAT_2003764_Title.pdf
Download (1MB)
[img] Text
S_MAT_2003764_Chapter1.pdf
Download (371kB)
[img] Text
S_MAT_2003764_Chapter2.pdf
Restricted to Staf Perpustakaan
Download (527kB)
[img] Text
S_MAT_2003764_Chapter3.pdf
Download (853kB)
[img] Text
S_MAT_2003764_Chapter4.pdf
Restricted to Staf Perpustakaan
Download (1MB)
[img] Text
S_MAT_2003764_Chapter5.pdf
Download (278kB)
[img] Text
S_MAT_2003764_Appendix.pdf
Restricted to Staf Perpustakaan
Download (2MB)
Official URL: https://repository.upi.edu/

Abstract

Penelitian ini membahas Capacitated Dynamic Vehicle Routing Problem (CDVRP), yaitu masalah penentuan rute pendistribusian barang dari depot ke sejumlah pelanggan untuk memenuhi permintaan pelanggan. Pendistribusian dilakukan oleh sejumlah kendaraan dengan batasan kapasitas tertentu. Permintaan pelanggan dapat berubah setiap saat sehingga dapat mengakibatkan rute yang sedang dijalankan oleh kendaraan mengalami perubahan. Dalam penelitian ini, CDVRP akan diselesaikan dengan menggunakan algoritma Improved Ant Colony Optimization dengan local search 2-opt, dengan parameter banyaknya semut (s) sebanyak 5, pheromone awal sebesar 0,5, nilai Q sebesar 100, nilai α sebesar 1, nilai β sebesar 1, tingkat penguapan pheromone (ρ) 0,15 atau 15%, dan banyaknya iterasi adalah 50. Dari 30 percobaan yang dilakukan, diperoleh total jarak minimum yang didapatkan adalah 1344 km. Hasil implementasi menggunakan Algoritma IACO pada masalah pendistribusian produk skincare suatu perusahaan menunjukkan bahwa masalah CDVRP dapat diselesaikan dengan metode IACO. This research discusses a Capacitated Dynamic Vehicle Routing Problem (CDVRP), which is the problem for determining the route for distributing goods from a depot to several customers to meet customer demand. Several vehicles with certain capacity constraints carry out distribution. Customer demand can change at any time so it can cause the route being run by the vehicle to change. In this study, CDVRP will be solved using the Improved Ant Colony Optimization Algorithm with local search 2-opt, with parameters of the number of ants (s) as many as 5, the initial pheromone of 0.5, Q value of 100, α value of 1, β value of 1, pheromone evaporation rate (ρ) 0.15 or 15%, and the number of iterations is 50. From 30 experiments conducted, the total minimum distance obtained is 1344 km. The implementation results using the IACO Algorithm on the skincare product distribution problem of a company show that the CDVRP problem can be solved by the IACO method. The author's suggestion for further research is to explore the combination of the IACO method with other optimization algorithms as well as additional experiments with various parameters in IACO.

Item Type: Thesis (S1)
Additional Information: https://scholar.google.com/citations?view_op=new_profile&hl=id&authuser=1 ID SINTA Dosen Pembimbing: Khusnul Novianingsih: 258640 Imam Nugraha Albania: 6711447
Uncontrolled Keywords: Capacitated Dynamic Vehicle Routing Problem, Improved Ant Colony Optimization, distribusi, Optimasi rute Capacitated Dynamic Vehicle Routing Problem, Improved Ant Colony Optimization, distribution, route optimization
Subjects: Q Science > QA Mathematics
Divisions: Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Jurusan Pendidikan Matematika > Program Studi Matematika (non kependidikan)
Depositing User: Nabila Amelia Putri
Date Deposited: 08 Sep 2024 00:06
Last Modified: 08 Sep 2024 00:06
URI: http://repository.upi.edu/id/eprint/122962

Actions (login required)

View Item View Item