Algoritma Artificial Bee Colony untuk Multi Depot Vehicle Routing Problem
Algoritma Artificial Bee Colony untuk Multi Depot Vehicle Routing Problem
Authors | ||
Issue | Vol 2 No 4 (2019): Talenta Conference Series: Energy and Engineering (EE) | |
Section | Articles | |
Section |
Copyright (c) 2019 TALENTA Publisher This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License. |
|
Galley | ||
DOI: | https://doi.org/10.32734/ee.v2i4.673 | |
Keywords: | Bencana Logistik MDVRP ABC Disaster Logistic | |
Published | 2019-12-18 |
Abstract
Perencanaan logistik untuk tanggap bencana merupakan hal yang sangat penting dilakukan agar menjamin kebutuhan para korban bencana. Penelitian ini mengkaji salah satu permasalahan logistik pasca bencana yaitu Vehicle Routing Problem (VRP) dengan fungsi tujuan meminimumkan waktu pengiriman kebutuhan korban. Berdasarkan survey yang telah dilakukan, VRP yang dikaji dalam penelitian ini adalah Multi Depot Vehicle Routing Problem (MDVRP). Algoritma Artificial Bee Colony (ABC) digunakan untuk pemecahan permasalahan. Algoritma ABC merupakan salah satu metode metaheuristik dimana pencarian solusi berdasarkan prilaku lebah. Hasil yang diperoleh menggunakan algoritma ABC adalah 6 kendaraan yang ditugaskan dari 3 gudang dimana setiap gudang menggunakan 2 kendaraan dengan total waktu tempuh 222 menit.
Logistics planning for disaster response is very important to do to ensure the needs of disaster victims. This study examines one of the post-disaster logistical problems namely Vehicle Routing Problem (VRP) with the objective function of minimizing the delivery time of victims' needs. Based on the survey that has been conducted, the VRP studied in this study is the Multi Depot Vehicle Routing Problem (MDVRP). Artificial Bee Colony (ABC) algorithm is used for solving this problem. This algorithm is one of the metaheuristic methods where the search for solutions is based on the principle of bees. The results obtained using the ABC algorithm are 6 vehicles assigned from 3 warehouse where each warehouse uses 2 vehicles with a total travel time of 222 minutes.