Shortest Path Search Futsal Field Location With Dijkstra Algorithm

https://doi.org/10.22146/ijccs.34513

Delpiah Wahyuningsih(1*), Erzal Syahreza(2)

(1) STMIK Atma Luhur Pangkalpinang
(2) Information Technology, Pangkalpinang,
(*) Corresponding Author

Abstract


Pangkalpinang City is a city where futsal field rentals are experiencing growth and improvement. The number of lovers of futsal sport from outside Pangkalpinang city, especially those who are less aware of the streets in Pangkalpinang city will have little difficulty in accessing futsal field places in this city because they do not know in detail information about the route to the futsal field. This research can facilitate futsal players in searching shortest path futsal field with algorithm dijkstra. The dijkstra algorithm determines the shortest path by computing the nodes passed from the initial node to the destination node. Dijkstra algorithm by forming the node graph, the new node then perform the calculation of the number of nodes that will form a new node for the determination of the node to be passed so that the algorithm dijkstra find the smallest node that will form the shortest path in the geographic information system. This system displays the shortest route from the user position to the futsal field which is the destination in the city of Pangkalpinang and surrounding areas.


Keywords


Dijkstra Algorithm; Shortest Path; Futsal Field

Full Text:

PDF


References

[1]          S. Arifianto, “Sistem Aplikasi Penentuan Rute Terpendek Pada Jaringan Multi Moda Transportasi Umum Menggunakan Algoritma Dijkstra” Tesis Universitas Diponegoro Semarang 2012 [Online]. Available: http://eprints.undip.ac.id/36054/.  [Accessed: 14-Sept-2017]

[2]          Y. Primadasa, “Pencarian Rute Terpendek Menggunakan Algoritma Dijkstra pada  SIG Berbasis Web untuk Distribusi Minuman”,  Jurnal KomtekInfo Fakultas Ilmu Komputer Volume.2, No.2, 2015 [Online]. Available: http://lppm.upiyptk.ac.id/komtekinfo/index.php/KOMTEKINFO/article/view/35.  [Accessed: 14-Sept-2017]

[3]          M. L. Radhitya and A. Harjoko, “Sistem Informasi Geografis Risiko Kemunculan Rip Current Menggunakan Decision Tree C4.5”, IJCCS (Indonesian Journal of Computing and Cybernetics System)., vol.10, no.2, 2016 [Online]. Available: https://journal.ugm.ac.id/ijccs/article/view/15949. [Accessed: 9-Des-2017]

[4]          Heriadi and D. Wahyuningsih, “Aplikasi Sistem Informasi Geografis Pemetaan Kawasan Pertambangan Timah Berbasis Web Studi Kasus Di Dinas Pertambangan Dan Energi Kabupaten Bangka Tengah”, Jurnal Sisfokom, Vol 3 No 2 September 2014 [Online]. Available: http://jurnal.atmaluhur.ac.id/index.php/sisfokom/article/view/207. [Accessed: 14-Sept-2017]

[5]          A. Gusmao, S. H. Pramono and Sunaryo, ”Sistem Informasi Geografis Pariwisata Berbasis Web dan Pencarian Jalur Terpendek dengan Algoritma Dijkstra”,  Jurnal EECCIS Vol. 7, No. 2, Desember 2013 [Online]. Available: http://www.jurnaleeccis.ub.ac.id/index.php/eeccis/article/view/214. [Accessed: 14-Sept-2017]

[6]          W. Azzaki and D. Wahyuningsih, “Pencarian Lokasi Tempat Penyewaan Mobil Daerah Kota Pangkalpinang Berbasis Sistem Informasi Geografis”, Teknosi, Vol. 02, No. 03 Desember 2016 [Online]. Available: http://teknosi.fti.unand.ac.id/index.php/teknosi/article/view/75. [Accessed:13-Sept-2017]

[7]          G. Saindra  and R. Pulungan, “Reduksi Parameter Quality-Of-Service Menggunakan Rough-Set-Theory Dalam Simulasi Routing Algoritma Dijkstra”, IJCCS (Indonesian Journal of Computing and Cybernetics System)., vol.6, no.1, 2012 [Online]. Available: https://journal.ugm.ac.id/ijccs/article/view/2143/1924. [Accessed: 9-Des-2017]

[8]          Siringoringo and Y. B. Putra, “Penentuan Rute Terpendek Sistem Pengangkutan Sampah Kota Medan dengan Menggunakan Algoritma Dijkstra (Studi Kasus: Kecamatan Medan Baru)”, Skripsi Universitas Sumatera Utara Medan 2014 [online]. Available: http://repository.usu.ac.id/handle/123456789/61481. [Accessed: 14-Sept-2017]

[9]          Fitria and A. Triansyah, “Implementasi Algoritma Dijkstra dalam Aplikasi untuk Menentukan Lintasan Terpendek Jalan Darat Antar Kota di Sumatera Bagian Selatan”, JSI (Jurnal Sistem Informasi), Vol.5, No.2, 2013 [Online]. http://ejournal.unsri.ac.id/index.php/jsi/article/view/840. [Accessed: 9-Des-2017]

[10]      S. Andayani and E. W. Perwitasari, “Penentuan Rute Terpendek Pengambilan Sampah di Kota Marauke Menggunakan Algoritma Dijkstra”, Seminar Nasional Teknologi Informasi dan Komunikasi Terapan (SEMANTIK), 2014 [Online]. http://eprints.dinus.ac.id/13736/. [Accessed:9-Des-2017]



DOI: https://doi.org/10.22146/ijccs.34513

Article Metrics

Abstract views : 595 | views : 378

Refbacks

  • There are currently no refbacks.




Copyright (c) 2018 IJCCS (Indonesian Journal of Computing and Cybernetics Systems)

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.



Copyright of :
IJCCS (Indonesian Journal of Computing and Cybernetics Systems)
ISSN 1978-1520 (print); ISSN 2460-7258 (online)
is a scientific journal the results of Computing
and Cybernetics Systems
A publication of IndoCEISS.
Gedung S1 Ruang 416 FMIPA UGM, Sekip Utara, Yogyakarta 55281
Fax: +62274 555133
email:ijccs.mipa@ugm.ac.id | http://jurnal.ugm.ac.id/ijccs



View My Stats1
View My Stats2