Analisis rute distribusi dengan jarak tempuh terpendek pada produk air mineral dalam kemasan (AMDK) (studi kasus CV. XYZ)

Bambang Herry Purnomo, Noer Noer Novijanto, Chandra Wahyu Ramadhan

Abstract

The local-brand mineral water industry faces intense market competition with the national mineral water industry. In order to be competitive, the local-brand mineral water industry must make various efficiency efforts to reduce production costs, including by planning short product distribution channels. CV. XYZ is a mineral water distributor company in Jember Regency which is also required to make efficient product distribution routes. The purpose of this research is to optimize to determine the shortest distribution route in order to save on the cost of distributing mineral water products. The method used is the Traveling Salesman Problem (TSP), namely the Nearest Neighbor and Cheapest Insertion Heuristic (CIH) methods. The two methods differ only in the exploration program, where Nearest Neighbor explores from any adjacent point, while CIH explores from a certain point and then traces through sub tours to find the shortest route. Based on the survey results, the distribution route currently covers the longest distance of 106.1 km. With the Nearest Neighbor method, the route can be shortened to 72.34 km with a distance saving percentage of 31.82% from the initial route. Meanwhile, the Cheapest Insertion Heuristic (CIH) method produces a total distance of 72.14 km with a distance saving percentage of 32.01%. Fuel savings with the first method of Rp. 1,043,184 while the second method is Rp. 1,049,376. These results indicate that the TSP method can help companies shorten time and save distribution costs.

Keywords

Distribution route; Traveling Salesman Problem; Total Distance

References

Ardiansyah, M. V., R. A. Darajatun, and D. N. Rinaldi. 2021. Optimalisasi Pendistribusian Dengan Metode Travelling Salesman Problem Untuk Menentukan Rute Terpendek Di Pt Xyz. Tekmapro : Journal of Industrial Engineering and Management 16(2):84–95.

Hutasoit, C. S., S. Susanty, and A. Imran. 2014. Penentuan Rute Distribusi Es Balok Menggunakan Algoritma Nearest Neighbour dan Local Search (Studi kasus di PT X). Reka Integra 02(02):268–276.

Kurniawan, I. S., S. Susanty, and H. Adianto. 2014. Usulan Rute Pendistribusian Air Mineral Dalam Kemasan Menggunakan Metode Nearest Neighbour dan Clarke & Wright Savings. Jurnal Online Institut Teknologi Nasional 01(04):125–136.

Oktavia, C. W., C. Natalia, and I. Adigunawan. 2019. Penentuan Jalur Rute Distribusi Produk Fast Moving Consumer Goods (FMCG) dengan Menggunakan Metode Nearest Neighbour (Studi Kasus: PT.XYZ). Jurnal Al-Azhar Indonesia Seri Sains dan Teknologi 5(2):101.

Utomo, R. G., D. S. Maylawati, and C. N. Alam. 2018. Implementasi Algoritma Cheapest Insertion Heuristic (CIH) dalam Penyelesaian Travelling Salesman Problem (TSP). Jurnal Online Informatika 3(1):61.

Wiyanti, D. T. 2013. Algoritma Optimasi Untuk Penyelesaian Travelling Salesman Problem. Jurnal Transformatika 11(1).

Wulandari, C. B. K. 2020. Penentuan Rute Distribusi Menggunakan Metode Nearest Neighbors dan Metode Branch and Bound Untuk Meminimumkan Biaya Distribusi di PT. X. Jurnal Optimasi Teknik Industri (JOTI) 2(1):7.

Yulianto, E., and A. Setiawan. 2013. Optimalisasi Rute Sales Coverage Menggunakan ALgoritma Cheapest Insertion Heuristic dan Layanan Google Maps API. Journal of Chemical Information and Modeling 53(9):1689–1699.

Zaky, G. A., and F. Hadi. 2013. Model konseptual perencanaan transportasi bahan bakar minyak (BBM) untuk wilayah kepulauan (Studi kasus: Kepulauan Kabupaten Sumenep). Jurnal Teknik POMITS 2(1):1–5.

DOI

https://doi.org/10.21107/agrointek.v17i3.15862

Metrics

Refbacks

  • There are currently no refbacks.




Copyright (c) 2023 Bambang Herry Purnomo, Noer Noer Novijanto, Chandra Wahyu Ramadhan

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.