| NIM | K1B022023 |
|---|
| Namamhs | LUTHFIA MIGI TRIANA |
|---|
| Judul Artikel | PENERAPAN ANT COLONY OPTIMIZATION UNTUK PENYELESAIAN CAPACITATED VEHICLE ROUTING PROBLEM PADA RUTE PENGANGKUTAN SAMPAH DI PURWOKERTO
|
|---|
| Abstrak (Bhs. Indonesia) | Tingginya volume sampah di Purwokerto membutuhkan sistem pengangkutan sampah yang efisien. Permasalahan tersebut dimodelkan sebagai Capacitated Vehicle Routing Problem (CVRP) dengan mempertimbangkan kendala kapasitas kendaraan, titik awal dan akhir di depot, serta kewajiban kendaraan mengunjungi TPA BLE sebelum kembali ke depot. Penelitian ini bertujuan untuk menerapkan algoritma Ant Colony Optimization (ACO) untuk menentukan rute pengangkutan sampah yang optimal di Purwokerto. Langkah pencarian rute optimal dimulai dari inisialisasi parameter, penentuan rute setiap semut iterasi pertama, pembaruan feromon untuk iterasi selanjutnya yang dilakukan hingga hasilnya memenuhi kriteria pemberhentian. Data penelitian meliputi matriks jarak antartitik, permintaan pengangkutan sampah, kapasitas kendaraan, serta parameter algoritma ACO. Implementasi algoritma menggunakan software MATLAB menghasilkan rute optimal untuk tiga jenis sampah, yaitu sampah bahan RDF, sampah residu, dan bubur sampah. Hasil optimasi menunjukkan terbentuknya masing-masing 17, 8, dan 11 rute pengangkutan dengan total jarak dalam satu siklus berturut-turut sebesar 579,72 km, 282,85 km, dan 377,6 km. |
|---|
| Abtrak (Bhs. Inggris) | The high volume of waste in Purwokerto requires an efficient waste collection system. This problem is modelled as a Capacitated Vehicle Routing Problem (CVRP), taking into account vehicle capacity constraints, the start and end points at the depot, and the requirement for vehicles to visit the BLE landfill site before returning to the depot. This study aims to apply the Ant Colony Optimisation (ACO) algorithm to determine the optimal waste collection routes in Purwokerto. The process of finding the optimal route begins with parameter initialisation, route determination for each ant in the first iteration, and pheromone updating for subsequent iterations, which is carried out until the results meet the stopping criteria. The research data included a matrix of distances between points, waste collection demand, vehicle capacity, and ACO algorithm parameters. Implementation of the algorithm using MATLAB software produced optimal routes for three types of waste: RDF (Refuse-Derived Fuel), residual waste, and sludge. The optimisation results show the formation of 17, 8, and 11 transport routes respectively, with total distances per cycle of 579.72 km, 282.85 km, and 377.6 km. |
|---|
| Kata kunci | Ant Colony Optimization, Capacitated Vehicle Routing Problem, rute optimal, pengangkutan sampah, MATLAB |
|---|
| Pembimbing 1 | Renny, M.Si. |
|---|
| Pembimbing 2 | Niken Larasati, M.Si. |
|---|
| Pembimbing 3 | |
|---|
| Tahun | 2026 |
|---|
| Jumlah Halaman | 140 |
|---|
| Tgl. Entri | 2026-08-14 06:18:18.948415 |
|---|