Abstract
The success indicators of disaster mitigation can be seen from the disaster logistics system. Effective and efficient distribution network can make a good disaster logistics system. The problem that related to the design of this network is the vehicle routing problem. The objective is determined optimal route of relief distribution from warehouse to victims with minimum time duration. The problem is solved by branch and bound, insertion heuristic, and local search algorithms. The results obtained by branch and bound and local search algorithm are optimal global. Time duration of vehicle using these algoritm is 1.0562 hours. However, computation time using branch and bound algorithm is very long until 22 hours while local search algorithm only takes 60 seconds. The insertion heuristic algorithm also produces a good solution. Time duration of vehicle using this algoritm is 1,1030 hours. This solution is local optimal, but the computation time is very short, only 0.001 seconds.
Highlights
The success indicators of disaster mitigation can be seen from the disaster logistics system
The problem that related to the design of this network is the vehicle routing problem
The problem is solved by branch
Summary
Menurut Thomas dan Kopczak (2005) masalah utama yang sering dihadapi dalam sistem logistik bencana bukanlah jumlah pasokannya, namun pendistribusian yang lambat dan tidak tepat. Penelitian lain yang berhubungan dengan penelitian ini telah dilakukan oleh Mahendra (2015) dimana dalam penelitiannya ditemukan solusi optimal dalam Travelling Salesman Problem (TSP) untuk penentuan rute distribusi bantuan bencana erupsi gunung Merapi di Yogyakarta, namun asumsi yang digunakan adalah tidak mempertimbangkan jenis logistik yang dikirimkan dan kapasitas kendaraan selalu dapat mencukupi kebutuhan yang ada. Oleh karena itu untuk pemecahan permasalahan NP-hard dengan waktu komputasi singkat dan tidak mengabaikan kualitas solusi yang akan diperoleh, dalam penelitian ini akan dirancang sebuah metode metaheuristik yang cukup populer digunakan untuk menyelesaikan kasus VRP. Juga akan digunakan algoritma insertion heuristic (IH) sebagai algoritma kontruksi, kemudian algoritma LS sebagai algoritma perbaikan
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
