IMPLEMENTASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN JALUR TERPENDEK DALAM DISTRIBUSI BARANG

Authors

  • Ikhsan Baharudin Universitas Widyatama
  • Ahmad Jaka Purwanto Universitas Widyatama
  • Teguh Rahayu Budiman Universitas Widyatama
  • Muchammad Fauzi Universitas Widyatama

DOI:

https://doi.org/10.46306/lb.v2i2.74

Keywords:

dijkstra, Transportasi, Stokastik, Riset Operasi, Jalur terpendek, Transport, Stochastic, Operations Research, Shortest Path

Abstract

PT. X is a company domiciled in Gedebage, Bandung which is engaged in the manufacturing industry by producing precision parts using CNC machines. PT. X is a sub-contracting company that usually serves project work from other companies. PT. Y and PT. Z is a regular customer who often works with PT. X. So that PT. X often sends finished products directly to PT. Y who is domiciled on Jl. Gatot Subroto, Bandung and also PT. Z who is domiciled on Jl. Pajajaran, Bandung. To minimize the cost of distribution of goods, PT. X must determine an adequate path taking into account the optimization of transportation costs. One of the variables that affect transportation costs is distance. It is assumed that the optimal path for transportation costs is the shortest distance using the Dijkstra method. This test uses data from Google Maps to find out the distance to each destination, making it easier to get the shortest path. Obtained the shortest path from PT. X to PT.Y is 12.3 Km via West Java Police then Carefour, while the shortest route is from PT. Y to PT. Z is 10.7 Km via Simpang Lima then Vie Hotel Westhoff. So that the optimal total mileage for distributing goods is 23 Km.

Downloads

Download data is not yet available.

References

Agustinus, R. (2018). Optimasi Masalah Transportasi Stokastik. http://repositori.usu.ac.id

Ardana, D., & Saputra, R. (2016). Penerapan Algoritma Dijkstra pada Aplikasi Pencarian Rute Bus Trans Semarang. In Seminar Nasional Ilmu Komputer.

Ferdiansyah, & Rizal, A. (2013). Penerapan Algoritma Dijkstra untuk Menentukan Rute Terpendek Pembacaan Water Meter Induk PDAM Tirta Kerta Raharja Kabupaten Tangerang. In Jurnal TICOM (Vol. 2, Issue 1).

Halda, R., Ranius, A. Y., Kom, S., Syaputra, H., Kom, M., Universitas, M., Darma, B., & Universitas, D. (2016). Implementasi Algoritma Dijkstra Untuk Menentukan Jalur Terpendek Rumah Sakit Di Kota Palembang.

Harahap, M. K., & Khairina, N. (2017). Pencarian Jalur Terpendek dengan Algoritma Dijkstra. SinkrOn, 2(2), 18. https://doi.org/10.33395/sinkron.v2i2.61

Ismet. (2014). Pengertian Sub-kontraktor Pada Proyek. Retrieved June 7, 2021, from http://projectmedias.blogspot.com/2014/01/pengertian-subkontraktor-pada-proyek.html

Kholik, A., Wahyudi, E. E., Devianto, K., & Sholihah, N. (2018). Sistem Rekomendasi Berbasis Genetic Algorithm : Studi Kasus Pembelian Komponen Komputer dan Aksesorisnya. Seminar Nasional Aplikasi Teknologi Informasi (SNATi) 2018, 30–34.

Mahdia, F. (2013). PEMANFAATAN GOOGLE MAPS API UNTUK PEMBANGUNAN SISTEM INFORMASI MANAJEMEN BANTUAN LOGISTIK PASCA BENCANA ALAM BERBASIS MOBILE WEB. Retrieved June 7, 2021, from https://media.neliti.com

Muhammad Rismawan Ridha. (2020). ERROR CORRECTION MODEL ANALYSIS OF THE DETERMINANT OF STABILITY OF FINANCIAL SYSTEM IN INDONESIA. Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika Dan Statistika, 1(2), 82–90. doi:10.46306/lb.v1i2.19

Nurrizky, M. F., Dwiagnes, S., & Anggraeni, N. F. (2020). Pencarian Rute Terpendek Pada Distribusi Raw Material Metode Djikstra Di PT. SHP. Jurnal Teknik: Media Pengembangan Ilmu Dan Aplikasi Teknik, 19(1), 34. https://doi.org/10.26874/jt.vol19no01.141

Wijayanti, S., Prihandono, B., & Kusnandar, D. (2015). Algoritma Dijkstra Untuk Mencari Lintasan Terpendek Dan. 04(3), 243–250.

Published

2021-08-30

How to Cite

Baharudin, I., Purwanto, A. J. ., Budiman, T. R. ., & Fauzi, M. . (2021). IMPLEMENTASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN JALUR TERPENDEK DALAM DISTRIBUSI BARANG. Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika Dan Statistika, 2(2), 194-203. https://doi.org/10.46306/lb.v2i2.74