PERBANDINGAN ALGORITMA DIJKSTRA DAN FLOYD-WARSHALL DALAM MENENTUKAN RUTE TERPENDEK STASIUN GUBENG MENUJU WISATA SURABAYA

Authors

DOI:

https://doi.org/10.31000/jika.v6i3.6528

Abstract

Persoalan penentuan rute terpendek sudah menjadi hal umum untuk dibahas berkaitan dengan cara penyelesaiannya yang menggunakan graf. Penyelesaian tersebut umumnya digunakan dengan tujuan untuk mengoptimalisasi aspek tertentu, contohnya dalam hal penggunaan bahan bakar dan waktu tempuh. Penyelesaian tersebut dapat diraih dengan penerapan salah satu komponen dalam graf yaitu algoritma. Jurnal ini ditulis guna membantu masyarakat terlebih para turis dalam memberikan informasi terkait rute yang paling efisien dari titik awal stasiun menuju ke berbagai destinasi wisata kota Surabaya dengan penerapan Algoritma Dijkstra dan Algoritma Floyd-Warshall. Teknik yang digunakan dalam perhitungan dilaksanakan secara manual dan bantuan program dengan Bahasa C. Melalui penelitian tersebut, hasil yang diperoleh Algoritma Dijkstra memiliki efisiensi yang lebih tinggi dari segi perhitungan dan kompleksitas programnya. Perhitungan yang dilaksanakan pada kedua algoritma menunjukkan hasil berupa nilai bobot minimum yang sama dan tepat, adapun juga informasi terkait lintasan terpendek yang dapat diterapkan masyarakat guna meningkatkan efisiensi dalam berwisata di kota Surabaya. Untuk rute terpendek yang diperoleh pada perbandingan dua algoritma adalah pada perjalanan dengan titik awal Stasiun Gubeng menuju Jalan Taman Apsari dengan jarak tempuh sejauh 1,2 km.

References

Andiany, F. E., & Hadikurniawati, W. (2018). Implementasi Algoritma Dijkstra Untuk Mencari Rute Terpendek Antar Kantor Dan Estimasi Penggunaan Bahan Bakar Kendaraan (Studi Kasus PT. Telkom Indonesia Regional IV Jateng-DIY).

Apriliani, I. M., Herawati, H., Khan, A. M., Dewanti, L. P., & Rizal, A. (2018). Pengenalan Teknologi Global Positioning System (GPS) Sebagai Alat Bantu Operasi Penangkapan Ikan Di Pangandaran (Vol. 7).

Cantona, A., Fauziah, & Winarsih. (2020). Implementasi Algoritma Dijkstra Pada Pencarian Rute Terpendek ke Museum di Jakarta. Jurnal Teknologi Dan Manajemen Informatika, 6(1). Retrieved from http://http://jurnal.unmer.ac.id/index.php/jtmi

Estining, D., Lufianawati, T., Adipura, C., & Dan Masjudin, W. (2021). Pelatihan Software Matlab Untuk Penyelesaian Masalah Di Bidang Matematika. Dharmakarya : Jurnal Aplikasi Ipteks Untuk Masyarakat, 10(1), 14–16. https://doi.org/10.24198/dharmakarya.v10i1.30015

Fitro, A., Saeful Bachri, O., Ilham, A., Purnomo, S., & Frendianata, I. (2018). Shortest Path Finding in Geographical Information Systems using Node Combination and Dijkstra Algorithm. International Journal of Mechanical Engineering and Technology (IJMET, 9(2), 755–760. Retrieved from http://www.iaeme.com/IJMET/index.asp755http://www.iaeme.com/IJMET/issues.asp?JType=IJMET&VType=9&IType=2http://www.iaeme.com/IJMET/issues.asp?JType=IJMET&VType=9&IType=2http://www.iaeme.com/IJMET/index.asp756

Iqbal, M., Zhang, K., Iqbal, S., & Tariq, I. (2018). A Fast and Reliable Dijkstra Algorithm for Online Shortest Path. In SSRG International Journal of Computer Science and Engineering ( SSRG-IJCSE ) (Vol. 5). Retrieved from http://www.internationaljournalssrg.org

Kien Hua, T., & Abdullah, N. (2018). Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria. Journal of Computer Science & Computational Mathematics, 8(3), 107–113. https://doi.org/10.20967/jcscm.2018.04.008

Lyonnais, H. (2011). Metode Pencarian Lintasan Terpendek Graf untuk Evakuasi Bencana.

Masri, M., Kiswanto, A. P., Santri Kusuma, B., Dosen, ), Alumni, ), & Abstrak, U. (n.d.). Implementasi Algoritma Dijkstra Dalam Perancangan Aplikasi Penentuan Rute Terpendek Pada Objek Pariwisata Danau Toba Dan Sekitarnya. Retrieved from http://maps.google.com.Google

Muharrom, M. (2020). Implementasi Algoritma Dijkstra Dalam Penentuan Jalur Terpendek Studi Kasus Jarak Tempat Kuliah Terdekat. Indonesian Journal of Business Intelligence (IJUBI), 3(1), 25. https://doi.org/10.21927/ijubi.v3i1.1229

Napiah, M., & Darma Astuti, R. (2022). Implementasi Algoritma Dijkstra Menentukan Jarak Terdekat Jelambar Kampus STMIK Nusa Mandiri Cengkareng (Vol. 7).

Rizaldy, M. R. (n.d.). Pencarian Jalur Terpendek dalam GPS dengan Menggunakan Teori graf Using Graph Theory for Finding Shortest Path in GPS.

Sakharov, V., Chernyi, S., Saburov, S., & Chertkov, A. (2021). Automatization Search for the Shortest Routes in the Transport Network Using the Floyd-warshell Algorithm. Transportation Research Procedia, 54, 1–11. Elsevier B.V. https://doi.org/10.1016/j.trpro.2021.02.041

Salaki, D. T. (n.d.). Penentuan Lintasan Terpendek Dari FMIPA Ke Rektorat Dan Fakultas Lain Di UNSRAT Manado Menggunakan Algoritma Dijkstra.

Sudarya Triana, Y., & Syahputri, I. (2018). Implementation Floyd-Warshall Algorithm for the Shortest Path of Garage. In International Journal of Innovative Science and Research Technology (Vol. 3). Retrieved from www.ijisrt.com

Wijaya, E., & Vera. (2016). Penerapan Sirkuit Hamilton Untuk Menentukan Rute Terpendek Perjalanan Salesman PT Health Wealth International (HWI). In Jurnal TIMES.

Wildan, A., Ramadhan, R., & Udjulawa, D. (2020). Perbandingan Algoritma Dijkstra dan Algoritma A Star Pada Permainan Pac-Man. In Jurnal Algoritme (Vol. 1).

Downloads

Published

2022-10-27

Issue

Vol. 6 No. 3 (2022): JIKA (Jurnal Informatika)

Section

Articles

License

License and Copyright Agreement

In submitting the manuscript to the journal, the authors certify that:

  • They are authorized by their co-authors to enter into these arrangements.
  • That it is not under consideration for publication elsewhere,
  • That its publication has been approved by all the author(s) and by the responsible authorities – tacitly or explicitly – of the institutes where the work has been carried out.
  • They secure the right to reproduce any material that has already been published or copyrighted elsewhere.
  • They agree to the following license and copyright agreement.

Copyright

Authors who publish with International Journal of Advances in Intelligent Informatics 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 License (CC BY-SA 4.0) 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.

Licensing for Data Publication

International Journal of Advances in Intelligent Informatics use a variety of waivers and licenses, that are specifically designed for and appropriate for the treatment of data:

Other data publishing licenses may be allowed as exceptions (subject to approval by the editor on a case-by-case basis) and should be justified with a written statement from the author, which will be published with the article.

Open Data and Software Publishing and Sharing

The journal strives to maximize the replicability of the research published in it. Authors are thus required to share all data, code or protocols underlying the research reported in their articles. Exceptions are permitted but have to be justified in a written public statement accompanying the article.

Datasets and software should be deposited and permanently archived inappropriate, trusted, general, or domain-specific repositories (please consult http://service.re3data.org and/or software repositories such as GitHub, GitLab, Bioinformatics.org, or equivalent). The associated persistent identifiers (e.g. DOI, or others) of the dataset(s) must be included in the data or software resources section of the article. Reference(s) to datasets and software should also be included in the reference list of the article with DOIs (where available). Where no domain-specific data repository exists, authors should deposit their datasets in a general repository such as ZENODO, Dryad, Dataverse, or others.

Small data may also be published as data files or packages supplementary to a research article, however, the authors should prefer in all cases a deposition in data repositories.