Implementasi Algoritma Dijkstra Rute Terpendek pada Aplikasi WisKul PasMing
Main Article Content
Abstract
Indonesia is famous for its various kinds of culinary tourism and spread in various areas of the city of Jakarta. Various types and locations of culinary make it difficult for local and foreign tourists to find and choose culinary dishes and the routes to culinary locations in Jakarta are very numerous and varied, especially foreign tourists. Therefore, the author tries to make an android-based culinary tourism location search application in the hope that it can provide a lot of culinary location information with the fastest and closest tracks, and is equipped with a map of culinary tourism locations. The algorithm used to find the shortest track uses the Dijkstra algorithm. The Dijkstra algorithm is a search algorithm for the shortest track based on the smallest track (edge) from the implementation location to the destination culinary tourism location. Culinary tourism area data and road data obtained from Google Earth and Google maps. From the origins of the trial of instances which have been done, it could be visible that the application has succeeded in implementing the Dijkstra solving procedure in finding the shortest route to culinary locations. This study produces the following distance node values BCDEJIF, ABCDFGHINM, MNIFDCBAE, BAEJNMLKHG, ABCDFGHIJE ABCDFGHILM, ABCGHKLMNIJE.
Downloads
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
The Authors submitting a manuscript do so on the understanding that if accepted for publication, copyright of the article shall be assigned to JTIK journal and Research Division, KITA Institute as the publisher of the journal. Copyright encompasses rights to reproduce and deliver the article in all form and media, including reprints, photographs, microfilms, and any other similar reproductions, as well as translations.
JTIK journal and Research Division, KITA Institute and the Editors make every effort to ensure that no wrong or misleading data, opinions or statements be published in the journal. In any way, the contents of the articles and advertisements published in JTIK journal are the sole and exclusive responsibility of their respective authors and advertisers.
The Copyright Transfer Form can be downloaded here: [Copyright Transfer Form JTIK]. The copyright form should be signed originally and send to the Editorial Office in the form of original mail, scanned document or fax :
Muhammad Wali (Editor-in-Chief)
Editorial Office of Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi)
Research Division, KITA Institute
Teuku Nyak Arief Street Nomor : 7b, Lamnyong, Lamgugop, Kota Banda Aceh
Telp./Fax: 0651-8070141
Email: jtik@lembagakita.org - journal@lembagakita.org
References
Djafar, I. and Marwan, M., 2016. Pembangunan Aplikasi Location Based Service (LBS) Kota Makassar. SEMNASTEKNOMEDIA ONLINE, 4(1), pp.4-7.
Al Amin, I.H., Lusiana, V. and Hartono, B., 2017. Visualisasi Pencarian Lintasan Terpendek Algoritma Floydwarshall Dan Dijkstra Menggunakan Tex.
Noviriandini, A. and Safitri, M., 2017. Implementasi Algoritma Dijkstra Untuk Menentukan Jalur Terpendek Wilayah Pisangan dan Kampus Nusa Mandiri Tangerang. Jurnal Pilar Nusa Mandiri, 13(2), pp.181-186.
Nugroho, A., Perancangan Aplikasi Pencarian Warteg Kharisma Bahari Menggunakan Location Based Service dengan Algoritma.
Utomo, R.B., Rumani, R.R.R. and Osmond, A.B., 2015. Aplikasi Pencarian Rute Menggunakan Algoritma Djikstra Berbasis Android Untuk Lalu Lintas Kota Bandung. eProceedings of Engineering, 2(3).
Anshori, Y., Joefrie, Y.Y. and Nadyanti, N., Implementasi Algoritma Dijkstra Dalam Pembuatan Aplikasi Pesona Palu. ScientiCO: Computer Science and Informatics Journal, 1(1), pp.25-31.
Standsyah, R.E. and Restu, I.S., 2017. Implementasi phpmyadmin pada rancangan sistem pengadministrasian. Unisda Journal of Mathematics and Computer Science (UJMC), 3(2), pp.38-44.
Galih, E.C. and Krisdiawan, R.A., 2018. Implementasi algoritma dijkstra pada aplikasi wisata kuningan berbasis android. Nuansa Informatika, 12(1).
Cantona, A., Fauziah, F. and Winarsih, W., 2020. Implementasi Algoritma Dijkstra Pada Pencarian Rute Terpendek ke Museum di Jakarta. Jurnal Teknologi dan Manajemen Informatika, 6(1), pp.27-34.
Ahdan, S. and Setiawansyah, S., 2020. Pengembangan Sistem Informasi Geografis Untuk Pendonor Darah Tetap di Bandar Lampung dengan Algoritma Dijkstra berbasis Android. Jurnal Sains Dan Informatika: Research of Science and Informatic, 6(2), pp.67-77.
Fatma, Y., Gunawan, F. and Mukhtar, H., 2020. Aplikasi Pencarian Rute Terpendek Tempat Wisata Di Kota Pekanbaru Menggunakan Floyd Warshall. JURNAL FASILKOM, 10(1), pp.54-60.
Galih, E.C. and Krisdiawan, R.A., 2018. Implementasi algoritma dijkstra pada aplikasi wisata kuningan berbasis android. Nuansa Informatika, 12(1).
Ardana, D. and Saputra, R., 2016, October. Penerapan Algoritma Dijkstra pada Aplikasi Pencarian Rute Bus Trans Semarang. In Seminar Nasional Ilmu Komputer (SNIK 2016) (Vol. 1, pp. 299-306).
Syepanda, M., Zulhalim, Z. and Haroen, R., 2021. Perancangan Aplikasi Pencarian Rute Wisata Kuliner Berbasis Android Menggunakan Algoritma Dijkstra Di Kota Tangerang Selatan. Jurnal Manajamen Informatika Jayakarta, 1(2), pp.117-133.
Tabrani, M., 2018. Penerapan Metode Waterfall Pada Sistem Informasi Inventori Pt. Pangan Sehat Sejahtera. Jurnal Inkofar, 1(2).
Budihartanti, C. and Pandiangan, R., 2016. Rancang Bangun Aplikasi Android Pencarian Rumah Sakit Di Jakarta Menggunakan Algoritma Dijkstra. PROSISKO: Jurnal Pengembangan Riset dan Observasi Sistem Komputer, 3(2).
Putra, D.W.T. and Andriani, R., 2019. Unified Modelling Language (UML) dalam Perancangan Sistem Informasi Permohonan Pembayaran Restitusi SPPD. Jurnal TeknoIf, 7(1), pp.32-39.