The comparison between the nearest neighbor algorithm and the a-star algorithm to determine the optimal route for distributing napkin tissue

Riri Syafitri Lubis; Rima Aprilia; Ropiqoh Ropiqoh; Silvia Harleni

doi:10.30821/axiom.v13i1.19977

The comparison between the nearest neighbor algorithm and the a-star algorithm to determine the optimal route for distributing napkin tissue

Riri Syafitri Lubis, Rima Aprilia, Ropiqoh Ropiqoh, Silvia Harleni

Abstract

Distribution is a factor that greatly influences the success of a company in selling its products. PT. Medan Jutarasa is a company that operates in the napkin tissue industry and has a Distribution Center (DC) to supply products to distributors. Distribution of products to consumers requires appropriate planning and consideration of which route to use to obtain more time-efficient transportation costs. In the delivery process, the company experienced problems, especially in the distribution route. The Nearest Neighbor algorithm searches for customers to serve based on the shortest distance from the vehicle's last location for further distribution. Meanwhile, the A-Star algorithm finds the shortest path using minimum cost. This research aims to compare the Nearest Neighbor algorithm and the A-Star algorithm to determine the optimal route for distributing tissue napkins by PT. Millionaire Medan. Based on the research results, it was found that the route using the Nearest Neighbor algorithm was more optimal than the A-Star algorithm in the distribution of tissue napkins by PT. Millionaire Medan.

Keywords

Distribution; Graph; Nearest neighbor algorithm; A-star algorithm

Full Text:

PDF

References

Dalem, I.B.G.W.A. (2018). Penerapan algoritma a* (star) menggunakan graph untuk menghitung jarak terpendek. Jurnal RESISTOR (Rekayasa Sistem Komputer), 1(1), 41–47. https://doi.org/10.31598/jurnalresistor.v1i1.253

Fernando, Y., Mustaqov, M.A., & Megawaty, D.A. (2020). Penerapan algoritma a-star pada aplikasi pencarian lokasi fotograpi di bandar lampung berbasis android. Jurnal Teknoinfo, 14(1), 27. https://doi.org/10.33365/jti.v14i1.509

Hermanto, D., & Dermawan, S. (2018). Penerapan algoritma a-star sebagai pencari rute terpendek pada robot hexapod. JURNAL NASIONAL TEKNIK ELEKTRO, 7(2), 122. https://doi.org/10.25077/jnte.v7n2.545.2018

Hutasoit, C.S., Susanty, S., & Imran, A. (2014). Penentuan rute distribusi es balok menggunakan algoritma nearest neighbour dan local search (studi kasus di pt x). Jurnal Online Institut Teknologi Nasional, 2(2), 268–276. https://ejurnal.itenas.ac.id/index.php/rekaintegra/article/view/428/593

Idayat, R., & Handayani, I. (2022). Penerapan algoritma a*star menggunakan graph untuk menentukan rute terpendek berbasis web. Pendidikan Dan Informatika, 1(1), 7–14. https://journal.mediapublikasi.id/index.php/manekin

Koswara, H. (2018). Penetuan rute distribusi produk kaos pada dobujack inv. menggunakan metode nearest neighbour dan (1-0) insertiono intra route. Jurnal Rekayasa Sistem & Industri (JRSI), 4(02). https://doi.org/10.25124/jrsi.v4i02.286

Lestari, P., Hasibuan, A., & Harahap, B. (2022). Analisis penentuan rute distribusi menggunakan metode nearest neighbor di pt medan juta rasa tanjung morawa. Factory Jurnal Industri, Manajemen Dan Rekayasa Sistem Industri, 1(1), 26–32. https://doi.org/10.56211/factory.v1i1.110

Muhammad, Bakhtiar, & Rahmi, M. (2017). Penentuan rute transportasi distribusi sirup untuk meminimalkan biaya. Industrial Engineering Journal, 6(1), 10–15. https://doi.org/10.53912/iejm.v6i1.152

Oktaviana, W.N., & Setiafindari, W. (2019). Penentuan rute distribusi kerupuk menggunakan metode saving matrix dan nearest neighbor. Jurnal INTECH Teknik Industri Universitas Serang Raya, 5(2), 81–86. https://doi.org/10.30656/intech.v5i2.1481

Perdana, V.A., Hunusalela, Z.F., & Prasasty, A.T. (2020). Penerapan metode saving matrix dan algoritma nearest neighbor dalam menentukan rute distribusi untuk meminimalkan biaya transportasi pada pt.xyz. JATI UNIK : Jurnal Ilmiah Teknik Dan Manajemen Industri, 4(1), 62–77. https://doi.org/10.30737/jatiunik.v4i1.986

Prasetyo, W., & Tamyiz, M. (2017). Vehiclerouting problem dengan aplikasi metode nearest neighbor. Journal of Research and Technology, 3(2), 88-99. https://doi.org/10.55732/jrt.v3i2.263

Purnama, S., Megawaty, D.A., & Fernando, Y. (2018). Penerapan algoritma a sttar (a*) untuk penentuan jarak terdekat widata kuliner di kota bandar lampung. Teknologi, 12(1), 28–32.

Rohandi, S.M., Imran, A., & Prassetiyo, H. (2014). Penetuan rute distribusi produk obat menggunakan metode sequential insertion dan clarke & wright savings (studi kasus pt x bandung). Jurnal Online Institut Teknologi Nasional, 2(2), 34–45. https://ejurnal.itenas.ac.id/index.php/rekaintegra/article/view/407

Sitepua, R.N.B., & Putra, G.N.A.C. (2022). Penentuan rute terpendek menggunakan algoritma a star. Jurnal Nasional Teknologi Informasi Dan Aplikasinya, 11), 431–440.

Suyudi, A., Imran, A., & Susanty, S. (2015). Usulan rancangan rute pendistribusian air galon hanaang menggunakan algoritma nearest neighbour dan local search. Jurnal Online Institut Teknologi Nasional, 3(4), 264–272. https://ejurnal.itenas.ac.id/index.php/rekaintegra/article/view/924

Wahyuni, M.S., Affandi, E., & Setiawan, D. (2022). Jaringan syaraf tiruan hopfield dalam mencari rute terpendek untuk pendistribusian barang. Jurnal Teknisi, 2(1), 1. https://doi.org/10.54314/teknisi.v2i1.852

Widodo, A.P., Sarwoko, E.A., & Firdaus, Z. (2017). Akurasi model prediksi metode backpropagation menggunakan kombinasi hidden neuron dengan alpha. Matematika, 20(2), 79–84.

DOI: http://dx.doi.org/10.30821/axiom.v13i1.19977