Analysis of the Effectiveness of Heuristic Methods in Determining the Shortest Route to Reduce Distribution Costs
Analisis Efektivitas Metode Heuristik dalam Penentuan Rute Terpendek untuk Mengurangi Biaya Distribusi
DOI:
https://doi.org/10.21070/ups.10670Keywords:
Heuristik, Distribution, Clarke and Saving Heuristik, Nearest NeighbourAbstract
The issue of delayed delivery in distribution causes customer complaints and operational costs. This study aims to determine the optimal distribution route to minimize travel distance and shipping costs. The methods used in this study are the Clarke and Wright Saving Heuristic and Nearest Neighbor. The results of the study show that the application of these two methods can produce more efficient distribution routes compared to the company's initial routes. Based on the research results, the combination of the Clarke and Wright Saving Heuristic and Nearest Neighbor methods can reduce the travel distance from 147.08 km to 92.52 km and reduce distribution costs by 37%. It can therefore be concluded that this method is effective in improving distribution efficiency, as both travel distance and costs can be minimized, resulting in more optimal delivery times.
Downloads
References
S. N. A. Rahmania, W. Wahyuda, and S. Gunawan, “Penentuan Rute Distribusi Barang Menggunakan Vehicle Routing Problem (Studi Kasus: CV. Surya Inti Distrindo),” INTECOMS J. Inf. Technol. Comput. Sci., vol. 6, no. 2, pp. 578–585, 2023, doi: 10.31539/intecoms.v6i2.6816.
M. Cat, K. F. Octaviarie, D. T. Liputra, and R. M. Heryanto, “Penentuan Rute Distribusi dengan Metode Heuristik dan Alternatif Skenario Penentuan Rute Distribusi dengan Metode Heuristik dan Alternatif Skenario pada Manufaktur Cat,” no. January, 2024, doi: 10.28932/sentekmi2023.v2i1.120.
R. Bisma, M. Hamid, R. Y. Anindhita, and R. Phahlevi, “Strategi Optimalsisasi Rute Distribusi BBM Studi Kasus TBBM Boyolali Distribusi Magetan,” vol. 3, no. 4, pp. 4611–4621, 2025.
V. Engraini, S. N. Meirizha, and D. Dermawan, “Optimasi Vehicle Routing Problem di PT. XYZ Menggunakan Metode Clarke and Wright Saving Heuristic dan Nearest Neighbour,” Sntiki, vol. 12, pp. 435–442, 2020.
L. E. Marpaung, J. Arifin, and W. Winarno, “Optimalisasi Rute Distribusi Menggunakan Algoritma Clarke and Wright Savings,” J. Media Tek. dan Sist. Ind., vol. 6, no. 2, p. 76, 2022, doi: 10.35194/jmtsi.v6i2.1784.
F. R. Afandy and R. Fayaqun, “JURNAL LOCUS : Penelitian & Pengabdian OPTIMASI PENDISTRIBUSI BARANG DENGAN METODE CLARKE AND WRIGHT,” vol. 2, no. 8, pp. 833–845, 2023, doi: 10.58344/locus.v2i8.1589.
A. R. Pasha, U. T. Yogyakarta, and U. T. Yogyakarta, “BIAYA MENGGUNAKAN METODE ALGORITMA CLARKE AND WRIGHT SAVINGS , DAN SEQUENTIAL INSERTION DI PABRIK,” vol. 3, no. 4, 2025.
R. Sakti and A. Daulay, “Analisis Kritis dan Pengembangan Algoritma K-Nearest Neighbor ( KNN ): Sebuah Tinjauan Literatur,” vol. 4, no. 2, pp. 131–141, 2024.
N. Aprilia, “Penerapan Metode Saving Matrix Untuk Meminimasi Biaya Pengiriman Produk Kemasan Pada PT XYZ,” vol. 1, no. 1, pp. 5–9, 2020.[10] F. J. Azhar et al.,“PENENTUAN RUTE TERBAIK PADA DISTRIBUSI PRODUK X DI PT BCD MENGGUNAKAN METODE SAVING MATRIX DAN,” pp. 702–712, 2023.
L. Octora, A. Imran, and S. Susanty, “Pembentukan Rute Distribusi Menggunakan Algoritma Clarke & Wright Savings dan Algoritma Sequential Insertion *,” vol. 02, no. 02, pp. 1–11, 2014.
L. Octora, A. Imran, and S. Susanty, “Pembentukan Rute Distribusi Menggunakan Algoritma Clarke & Wright Savings dan Algoritma Sequential Insertion,” Reka Integr., vol. 2, no. 2, pp. 1–11, 2019.
M. T. Santoso and T. Sukmono, “Analysis of Optimization of Raw Material Inventory Control Using the Linear Programming Method [ Analisis Optimalisasi Pengendalian Persediaan Bahan Baku Menggunakan Metode Linear Programming ],” pp. 1–10.
D. Prasetyo and I. Marodiyah, “Waste Area Risk Mitigation PT . XYZ using the HIRARC Method and Bow Tie Analysis [ Mitigasi Risiko Area Limbah PT . XYZ dengan menggunakan Metode HIRARC dan BowTie Analysis ],” pp. 1–10.
S. Nur et al.,“PENENTUAN RUTE DISTRIBUSI BARANG MENGGUNAKAN VEHICLE ROUTING PROBLEM ( STUDI KASUS : CV . SURYA INTI DISTRINDO ) DETERMINING GOODS DISTRIBUTION ROUTES USING VEHICLE ROUTING
Downloads
Additional Files
Posted
Categories
License
Copyright (c) 2026 UMSIDA Preprints Server
This work is licensed under a Creative Commons Attribution 4.0 International License.
