Khairul Muslim, Tjatur Supriyono

OPTIMALISASI RUTE DISTRIBUSI LOGISTIK TANGGAP DARURAT BENCANA DENGAN MENGGUNAKAN ALGORITMA SAVING MATRIX (STUDI KASUS ERUPSI GUNUNG MERAPI DI KABUPATEN MAGELANG)

Introduction

Optimalisasi rute distribusi logistik tanggap darurat bencana dengan menggunakan algoritma saving matrix (studi kasus erupsi gunung merapi di kabupaten magelang). Optimalkan rute distribusi logistik darurat bencana di Magelang menggunakan Algoritma Saving Matrix. Studi kasus erupsi Merapi, mengurangi jarak tempuh dan mempercepat waktu distribusi.

Abstract

Disaster logistics distribution requires a system that is fast, efficient, and adaptive. This study aimed to examine the effectiveness of the Saving Matrix algorithm in optimizing relief distribution routes during emergency operations of the Merapi eruption in Magelang Regency. The method employed was a comparative study between conventional distribution routes and routes generated through the Saving Matrix algorithm, using secondary data including distance, vehicle capacity, and terrain risk index. The findings revealed that the Saving Matrix algorithm reduced travel distance by more than 20% and accelerated distribution time. Moreover, the algorithm showed flexibility in adjusting to dynamic terrain conditions. This research concludes that the Saving Matrix method is not only theoretically relevant in the context of the Vehicle Routing Problem (VRP) but also practically applicable in disaster logistics distribution systems requiring high efficiency.

Review

This paper addresses a highly pertinent and critical area of research: the optimization of logistics distribution routes during emergency disaster response. The necessity for rapid, efficient, and adaptive systems in humanitarian aid cannot be overstated, and the authors correctly identify this core challenge. Focusing on the case study of the Merapi eruption in Magelang Regency, the study provides a valuable real-world context for its investigation into improving relief operations. The choice to explore the efficacy of the Saving Matrix algorithm for this specific application is both logical and promising, given its established utility in vehicle routing problems and the urgent need for optimized relief delivery. The methodological approach employs a comparative study, contrasting conventional distribution routes with those generated by the Saving Matrix algorithm. Utilizing secondary data encompassing crucial variables such as distance, vehicle capacity, and a critical terrain risk index, the study provides a robust framework for evaluation. The findings are compelling: the Saving Matrix algorithm demonstrably reduced travel distance by over 20% and significantly accelerated distribution time. Furthermore, the algorithm exhibited valuable flexibility in adapting to dynamic terrain conditions, a crucial factor in unpredictable disaster environments. These results strongly support the practical utility of the proposed optimization technique. In conclusion, this research successfully demonstrates the significant advantages of applying the Saving Matrix method for optimizing disaster logistics distribution. The study not only reinforces its theoretical relevance within the Vehicle Routing Problem (VRP) framework but, more importantly, provides strong empirical evidence of its practical applicability in demanding emergency scenarios. The substantial reductions in travel distance and distribution time, coupled with adaptability to challenging terrain, highlight its potential to enhance the efficiency and effectiveness of humanitarian aid efforts globally. This work makes a valuable contribution to the field of disaster management and logistics, offering a viable solution for improving critical relief operations.

Full Text

Comments

You need to be logged in to post a comment.