Implementasi Algoritma Dijkstra pada Aplikasi Go-Tahu dengan Pencarian Rute Terpendek ke Pabrik Tahu
Article Sidebar
Main Article Content
Abstract
Currently, the food business sector is increasing, one of which is tofu producers in South Tangerang. Many people who want to buy tofu of good quality but do not know the closest distance to the factory is located. In this research, we will use Dijkstra's Algorithm which is applied to the Android software to determine the shortest distance from one point to the tofu factory which is the chosen destination. Using the Dijkstra algorithm, an application will be designed, namely a mobile-based Go-Tofu for finding the closest route to the tofu factory. The route search process is carried out with a graph that has a weight and an area that is connected to a predetermined route. In the application test, it produces the shortest route from a house to the tofu factory with the smallest total weight of 11 kilometers based on the test results in the study.
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
Prasetyo, B.I.A. and Maslan, A., 2020. Analisis Perbandingan Pada Algoritma Bellman Ford Dan Dijkstra Pada Google Map. Khazanah Ilmu Berazam, 3(2), pp.337-349.
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.
Parapat, M.N., Kusbianto, D. and Rahmad, C., 2017. Rancang Bangun Aplikasi Pencarian Rute Terpendek Jasa Kiriman Barang Berbasis Mobile Dengan Metode Algoritma Dijkstra. Jurnal Informatika Polinema, 3(3), pp.15-15.
Triansyah, A., 2013. Implementasi Algoritma Dijkstra Dalam Aplikasi Untuk Menentukan Lintasan Terpendek Jalan Darat Antar Kota Di Sumatera Bagian Selatan. JSI: Jurnal Sistem Informasi (E-Journal), 5(2).
Ardana, D. and Saputra, R., 2016, October. Penerapan Algoritma Dijkstra pada Aplikasi Pencarian Rute Bus Trans Semarang. In Seminar Nasional Ilmu Komputer (SNIK 2016) (pp. 299-306).
Junanda, B., Kurniadi, D. and Huda, Y., 2018. Pencarian Rute Terpendek Menggunakan Algoritma Dijkstra Pada Sistem Informasi Geografis Pemetaan Stasiun Pengisian Bahan Bakar Umum. VoteTEKNIKA: Jurnal Vocational Teknik Elektronika dan Informatika, 4(1).
Serdano, A., Zarlis, M. and Hartama, D., 2019, August. Perbandingan Algoritma Dijkstra dan Bellman-Ford Dalam Pencarian Jarak Terpendek Pada SPBU. In Seminar Nasional Sains dan Teknologi Informasi (SENSASI) (Vol. 2, No. 1).
Hamdi, S. and Prihandoko, P., 2018. Analisis Algoritma Dijktra dan Algoritma Bellman-Ford Sebagai Penentuan Jalur Terpendek Menuju Lokasi Kebakaran (Studi Kasus: Kecamatan Praya Kota). Energy, 8(1), pp.26-32.
Harahap, M.K. and Khairina, N., 2017. Pencarian Jalur Terpendek dengan Algoritma Dijkstra. SinkrOn, 2(2), pp.18-23.
Aulia, R., Syahputra, E.R. and Dafitri, H., 2015. Sistem Pencarian Rumah Sakit Terdekat Menggunakan Algoritma Dijkstra Berbasis Android (Studi Kasus: rumah Sakit di Kota Medan). In Medan. Prosiding: SNASTIKOM (Seminar nasional teknologi informasi & komunikasi), jilid (Vol. 1, pp. 150-155).