Published: 2021-06-30
Implementasi Algoritma Dijkstra pada Aplikasi Go-Tahu dengan Pencarian Rute Terpendek ke Pabrik Tahu
DOI: 10.35870/jtik.v5i2.210
Downloads
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.
Keywords
Dijkstra Algorithm ; Android ; Flutter ; Shortest Line ; Tofu Factory
Article Information
This article has been peer-reviewed and published in the Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi). The content is available under the terms of the Creative Commons Attribution 4.0 International License.
-
Issue: Vol. 10 No. 3 (2026)
-
Section: Computer & Communication Science
-
Published: %750 %e, %2021
-
License: CC BY 4.0
-
Copyright: © 2021 Authors
-
DOI: 10.35870/jtik.v5i2.210
AI Research Hub
This article is indexed and available through various AI-powered research tools and citation platforms. Our AI Research Hub ensures that scholarly work is discoverable, accessible, and easily integrated into the global research ecosystem. By leveraging artificial intelligence for indexing, recommendation, and citation analysis, we enhance the visibility and impact of published research.
No author biographies available.
-
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).
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Authors who publish with this journal agree to the following terms:
1. Copyright Retention and Open Access License
Authors retain copyright of their work and grant the journal non-exclusive right of first publication under the Creative Commons Attribution 4.0 International License (CC BY 4.0).
This license allows unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
2. Rights Granted Under CC BY 4.0
Under this license, readers are free to:
- Share — copy and redistribute the material in any medium or format
- Adapt — remix, transform, and build upon the material for any purpose, including commercial use
- No additional restrictions — the licensor cannot revoke these freedoms as long as license terms are followed
3. Attribution Requirements
All uses must include:
- Proper citation of the original work
- Link to the Creative Commons license
- Indication if changes were made to the original work
- No suggestion that the licensor endorses the user or their use
4. Additional Distribution Rights
Authors may:
- Deposit the published version in institutional repositories
- Share through academic social networks
- Include in books, monographs, or other publications
- Post on personal or institutional websites
Requirement: All additional distributions must maintain the CC BY 4.0 license and proper attribution.
5. Self-Archiving and Pre-Print Sharing
Authors are encouraged to:
- Share pre-prints and post-prints online
- Deposit in subject-specific repositories (e.g., arXiv, bioRxiv)
- Engage in scholarly communication throughout the publication process
6. Open Access Commitment
This journal provides immediate open access to all content, supporting the global exchange of knowledge without financial, legal, or technical barriers.