Penerapan Metode Dijkstra Pada Jalur Distribusi LPG Untuk Penentuan Jarak Terpendek
- Novi Hendri Adi Universitas Ibnu Sina, Batam, Indonesia
- Muhammad Giatman Universitas Negeri Padang, Padang, Indonesia
- Wakhinuddin Simatupang Universitas Negeri Padang, Padang, Indonesia
- Afrina Afrina Universitas Ibnu Sina, Batam, Indonesia
-
Ronal Watrianthos
*
Universitas Al Washliyah, Rantauprapat,
Indonesia
(*) Corresponding Author
Abstract
Determining a shortest path is a crucial and necessary thing in connection with optimizing the time used and some savings in other fields. This research aims to design a software for determining the shortest distance on a web-based LPG gas distribution line by applying the Dijkstra solving procedure at PT. Amartha Anugrah Mandiri. This study uses the SDLC (software development life cycle) development method using waterfall modeling, to determine the closest route during the distribution of LPG gas using the Dijkstra solution procedure, namely by determining which location is used as the initial node, then set the distance value at the initial node to neighboring nodes. the closest one by one. The results of this study make it easier for drivers to find the closest route that can be passed to the base location. Dijkstra's solving procedure in the software for determining the shortest distance in the PT. Amartha Anugrah Mandiri can form the shortest distance traveled to get to the base
Downloads
References
Z. Ariansyah, D. D. S. Fatimah, and E. Retnadi, “Perancangan Perangkat Lunak Pendistribusian Liquified Petroleum Gas (LPG) Di PT. Denas Shantika Perkasa,” J. Algoritm., vol. 11, no. 2, pp. 282–290, 2015, doi: 10.33364/algoritma/v.11-2.282.
E. S. Arga, G. G. Firmansyah, K. Imam, and M. Fauzi, “Penerapan algoritma djikstra pada pencarian jalur terpendek,” vol. 1, no. 2, pp. 134–142, 2021.
M. N. Parapat, D. Kusbianto, and C. Rahmad, “Rancang Bangun Aplikasi Pencarian Rute Terpendek Jasa Kiriman Barang Berbasis Mobile Dengan Metode Algoritma Dijkstra,” J. Inform. Polinema, vol. 3, no. 3, p. 15, 2017, doi: 10.33795/jip.v3i3.28.
D. Ardana and R. Saputra, “Penerapan Algoritma Dijkstra pada Aplikasi Pencarian Rute Bus Trans Semarang,” Skripsi Jur. Ilmu Komputer, Fak. Sains Dan Mat. Univ. Diponegoro, no. Snik, pp. 299–306, 2016.
C. Prianto and M. Kusnadi, “Penerapan Algoritma Dijkstra Untuk Menentukan Rute Terbaik Pada Mobile E-Parking Berbasis Sistem Informasi Geografis,” J. Inform. J. Pengemb. IT, vol. 3, no. 3, pp. 329–335, 2018, doi: 10.30591/jpit.v3i3.941.
W. E. Y. Retnani, D. Istiadi, and A. Roqib, “Pencarian SPBU Terdekat dan Penentuan Jarak Terpendek Menggunakan Algoritma DIJKSTRA (Studi Kasus di Kabupaten Jember),” J. Nas. Tek. Elektro, vol. 4, no. 1, p. 89, 2015, doi: 10.25077/jnte.v4n1.132.2015.
S. Hamdi and Prihandoko, “Analisis Algoritma Dijktra dan Algoritma Bellman-Ford Sebagai Penentuan Jalur Terpendek Menuju Lokasi Kebakaran (Studi Kasus: Kecamatan Praya Kota),” J. Ilm. Ilmu-Ilmu Tek., vol. 8, no. 1, pp. 26–32, 2018.
W. Bangkit and T. A. Setiawan, “Rancang Bangun Aplikasi Scanner Car Location Berbasis Teknologi QR-Code menggunakan Algoritma Dijkstra,” pp. 1–5, 2019.
G. W. Sasmito, “Penerapan Metode Waterfall Pada Desain Sistem Informasi Geografis Industri Kabupaten Tegal,” J. Inform. Pengemb. IT, vol. 2, no. 1, pp. 6–12, 2017.
Y. Primadasa, “PENCARIAN RUTE TERPENDEK DIJKSTRA PADA SIG BERBASIS WEB UNTUK DISTRIBUSI MINUMAN ( STUDI KA ...,” 2016.
M. K. Harahap and N. Khairina, “Pencarian Jalur Terpendek dengan Algoritma Dijkstra,” SinkrOn, vol. 2, no. 2, p. 18, 2017, doi: 10.33395/sinkron.v2i2.61.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Penerapan Metode Dijkstra Pada Jalur Distribusi LPG Untuk Penentuan Jarak Terpendek
Pages: 235-243
Copyright (c) 2021 Novi Hendri Adi, Muhammad Giatman, Wakhinuddin Simatupang, Afrina Afrina, Ronal Watrianthos
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
