Distribution Route Optimization Using Nearest Neighbor Algorithm and Clarke and Wright Savings
DOI:
10.33395/sinkron.v8i3.12622Keywords:
VRP; Distribution; Nearest Neighbor; CWS; DistanceAbstract
in the process of this research Problems that occur is an irregular delivery of goods that takes a lot of time and delivery distance, so the distribution delivery process is not optimal. Therefore, researchers will conduct research on how to determine the best distribution route in optimizing delivery distance and time. The purpose of this study is to find distribution routes that are more optimal by using the nearest neighbor and Clarke and Wright savings and do a comparison with the company's current route This. The company's current mileage route is 319.9 km while using the nearest neighbor algorithm, the total distance traveled so far is obtained 240.9 and experienced mileage savings of 79 km or 25.22% and with the Clarke and Wright savings algorithm, the distance traveled is obtained 239.2 km and experienced mileage savings of 80.7 km or 25.22 %. Therefore, the Clarke and Wright Savings algorithm is more
Downloads
References
Aida, F. N., & Rahmanda, W. (2020). Analisis Biaya Transportasi Distribusi Pupuk Menggunakan Software Lingo. Jurnal Rekayasa Sistem Industri, 5(2), 135–145. doi:10.33884/jrsi.v5i2.1930
Darma, I. W. A. S. (2019). Implementation of Zoning and K-Nearest Neighbor in Character Recognition of Wrésastra Script. Lontar Komputer : Jurnal Ilmiah Teknologi Informasi, 10(1), 9. doi:10.24843/lkjiti.2019.v10.i01.p02
Emelia Rahmadany. (2021). PENYELESAIAN VEHICLE ROUTING PROBLEM DENGAN ALGORITMA CLARKE AND WRIGHT SAVINGS DI PERUSAHAAN UMUM BULOG MEDAN AMPLAS. Jurnal Pembangunan Wilayah & Kota, 1(3), 82–91.
Engraini, V., Meirizha, S. N., & Dermawan, D. (2020). Optimasi Vehicle Routing Problem di PT . XYZ Menggunakan Metode Clarke and Wright Saving Heuristic dan Nearest Neighbour. Seminar Nasional Teknologi Informasi, Komunikasi Dan Industri (SNTIKI) 12, 435–442.
Firmansyah. (2022). PENENTUAN RUTE DISTRIBUSI PRODUK AIR MINUM DALAM KEMASAN MENGGUNAKAN ALGORITMA NEAREST NEIGHBOUR. Retrieved from https://www.who.int/news-room/fact-sheets/detail/autism-spectrum-disorders
Leymena, L., Suryo, C., Yuniaristanto, & Sutopo, W. (2019). Analisis Penentuan Rute Distribusi Menggunakan Metode Nearest Neighbor. Seminar Dan Konferensi Nasional IDEC, E14.1-E14.7.
Melina Sari, G., Maini Heryanto, R., & Santoso, S. (2020). Penentuan Rute Distribusi Menggunakan Model Integer Linear Programming dengan Metode Branch and Bound. Go-Integratif : Jurnal Teknik Sistem Dan Industri, 1(01), 69–79. doi:10.35261/gijtsi.v1i01.4265
Mirza, A. H., & Irawan, D. (2020). Implementasi Metode Saving Matrix Pada Sistem Informasi Distribusi Barang. Jurnal Ilmiah Matrik, 22(3), 316–324. doi:10.33557/jurnalmatrik.v22i3.1050
Prasetyo, W., & Tamyiz, M. (2017). Vehicle Routing Problem Dengan Aplikasi Metode Nearest Neihbor. Route Construction and Local Search Algorithms Inform. System Operation Research, 3(2), 39:104-118.
Putra, F. D., Rakhmawati, F., & Cipta, H. (2021). Penentuan Rute Transportasi Kendaraan Umum Kota Medan Dengan Menggunakan Nearest Neighbor Method Dan Closed Insertion Method. Zeta - Math Journal, 6(2), 6–10. doi:10.31102/zeta.2021.6.2.6-10
Rohyana, C. (2021). Pengaruh Biaya Distribusi Terhadap Peningkatan Volume Penjualan Jasa Barang Di Jne Kuningan. Land Journal, 2(1), 95–106. doi:10.47491/landjournal.v2i1.1121
Downloads
|
How to Cite
Issue
Section
License
Copyright (c) 2023 Miftah Pratiwi, Riri Syafitri Lubis
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Muhammad Khoiruddin harahap
Google Scholar 
Moraref
PKP Index
Garuda Kemdikbud
Indonesia OneSearch
OCLC Worldcat
Dimensions
Index Copernicus
Scilit
