Solusi Optimal Pencarian Jalur Tercepat Menggunakan Algoritma Dijkstra Untuk Mencari Lokasi Cafe Di Bumiayu

Authors

  • Intan Alifiani STMIK Muhammadiyah Paguyangan Brebes, Indonesia
  • Muhamad Aznar Abdillah STMIK Muhammadiyah Paguyangan Brebes, Indonesia
  • Ilsa Saliha STMIK Muhammadiyah Paguyangan Brebes, Indonesia

DOI:

https://doi.org/10.31316/j.derivat.v8i2.1899

Abstract

The purpose of this study are (1) to represent the route of café location in Bumiayu in the form of graph, (2) To find a solution from the application of the Dijkstra’s algorithm to find location of café in Bumiayu, and (3) To find the recommended fastest route. The method used in this research is literature study, data collection, problem solving, and drawing conclusions. The results showed that (1) the route of café location in Bumiayu could be represented in the form of a graph, (2) the solution was found the implementation of Dijkstra’s algorithm to find the fastest route for the café location in Bumiayu, and (3) the recommended fastest route was obtained from the starting point (v32) to 14 café locations in Bumiayu (v1,v2,v3,v5,v7,v8,v9,v10,v12,v16,v19,v23,v27,v30). There are 13 café locations that match the recommended fastest route based on the calculation of Dijkstra’s algorithm. The route from starting point (v32) to due café (v9) is one example that Dijkstra’s algorithm does not always choose the smallest weight on each side but chooses the fastest route based on the total distance traveled. There is a discrepancy in the recommended fastest route from starting point (v32) to ratawit (v19).

Keywords: Dijkstra, fastest route, optimal solution

References

Cantona, A., Fauziah, F., & Winarsih, W. (2020). Implementasi Algoritma Dijkstra Pada Pencarian Rute Terpendek ke Museum di Jakarta. Jurnal Teknologi Dan Manajemen Informatika, 6(1), 27–34.

Ishlakhuddin, F., & Sn, A. (2021). Ontology-based Chatbot to Support Monitoring of Server Performance and Security by Rule-base. IJCCS (Indonesian Journal of Computing and Cybernetics Systems), 15(2), 131–140.

Marlina, L., Suyitno, A., & Mashuri. (2017). Penerapan Algoritma Dijkstra Dan Floyd-Warshall Untuk Menentukan Rute Terpendek Tempat Wisata Di Batang. Unnes Journal of Mathematics, 6(1), 36–47.

Mayhudi, L., & Khalik, W. (2018). Penentuan Rute Wisata Minimum di Pulau Lombok Nusa Tenggara Barat dengan Pendekatan Algoritma Dijkstra. Open Journal System Media Bina Ilmiah, 12(12), 689–698.

Muharrom, M. (2020). Algoritma, Implementasi Dalam, Dijkstra Jalur, Penentuan Kasus, Studi Tempat, Jarak Terdekat, Kuliah. Indonesian Journal of Business Intelligence, 3(1), 25–30.

Munir, R. (2010). Matematika Disktrit. In Informatika Bandung (Edisi 3).

Nanang, N., Rochmad, R., & Mashuri, M. (2019). Pencarian Rute Terbaik Pemadam Kebakaran Kota Semarang Menggunakan Algoritma Dijkstra dengan Logika Fuzzy sebagai Penentu Bobot pada Graf. Unnes Journal of Mathematics, 8(1), 40–49.

Ramdani, Y. (2006). Kajian Pemahaman Matematika Melalui Etika Pemodelan MAtematika. Mimbar, XXII(1), 1–14.

Rifanti, U. M. (2017). Pemilihan Rute Terbaik Menggunakan Algoritma Dijkstra Untuk Mengurangi Kemacetan Lalu Lintas di Purwokerto. JMPM: Jurnal Matematika Dan Pendidikan Matematika, 2(2), 90–99.

Rofiq, B. lutfi A., Februariyanti, H., Wibowo, J. S., & Budiarso, Z. (2021). Pencarian Tempat Ibadah Terdekat Menggunakan Algoritma Dijkstra. JUSIM (Jurnal Sistem Informasi Musirawas), 6(1), 19–28.

Rosen, K. H. (2012). Discrete Mathematics and its applications. In Mathematics, Substance and Surmise: Views on the Meaning and Ontology of Mathematics (Seventh Ed). McGraw-Hill Companies Inc.

Sulaiman, H., Yuliani, Y., Fitri, E., Herlinawati, N., & Watmah, S. (2020). Algoritma Dijkstra untuk Pendistribusian Carica Nida Food Wonosobo. Jurnal Sistem Dan Teknologi Informasi, 8(2), 203–206.

Sumaryo, R. Y., Harsadi, P., & Nugroho, D. (2020). Implementasi Algoritma Dijkstra Dan Metode Haversine Pada Penentuan Jalur Terpendek Pendakian Gunung Merapi Jalur Selo Berbasis Android. Jurnal TIKomSIN, 8(1), 61–67.

Sunardi, S., Yudhana, A., & Kadim, A. A. (2019). Implementasi Algoritma Dijkstra dan Algoritma Semut Untuk Analisis Rute Transjogja Berbasis Android. IT Journal Research and Development (ITJRD), 4(1), 1–9.

Wahyuningsih, D., & Syahreza, E. (2018). Shortest Path Search Futsal Field Location With Dijkstra Algorithm. IJCCS (Indonesian Journal of Computing and Cybernetics Systems), 12(2), 161–170.

Downloads

Published

2021-12-20

Issue

Vol. 8 No. 2 (2021): Jurnal Derivat (Desember 2021)

Section

Articles

Citation Check

License

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-ShareAlike 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.
  2. 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.
  3. 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 (See The Effect of Open Access).