Implementasi Algoritma Dijkstra untuk Rute Pengiriman Tahu di UMKM Pabrik Tahu Andra Sela
DOI:
https://doi.org/10.24269/jkt.v9i1.3221Keywords:
Black Box Testing, Dijkstra Algorithm, Rapid Application Development Method, Sales Report ManagementAbstract
In the digital era, the efficiency of goods distribution has become a crucial factor for industries to ensure smooth operations. Small-scale industries, such as tofu factories in Demangan Village, Siman, Ponorogo, still face challenges in managing distribution and transactions. This study aims to develop a web-based system that implements Dijkstra's algorithm for tofu delivery route optimization and provides transaction management features to support the company's operational efficiency, ensuring its sustainability. The system development follows the Rapid Application Development (RAD) methodology, which emphasizes speed and efficiency through prototyping and rapid iterations. System testing is conducted using Dijkstra's algorithm and Black Box Testing. Dijkstra's algorithm is manually verified to ensure the system can determine the optimal route based on distance or travel time, while Black Box Testing is used to verify system functionality, including data insertion and updates, order processing, and route calculation. The test results show that the system can determine the shortest delivery route, reduce travel time, and minimize operational costs. Additionally, the system supports real-time transaction recording, ensures data accuracy, and provides systematic reports for evaluating distribution performance. Thus, this system proves to be effective in improving tofu distribution efficiency and assisting strategic decision-making.References
Al Hakim, R. R., Satria, M. H., Arief, Y. Z., Pangestu, A., & Jaenul, A. (2021). Penggunaan Algoritma Dijkstra untuk Berbagai Masalah : Mini Review. Researchgate.Net, 1–10. Retrieved from https://rinarxiv.lipi.go.id/lipi/preprint/view/186
Anam, K., & Hartono, O. D. (2019). Aplikasi Pemandu Pencarian Wisata Terdekat Berbasis GIS Android Dengan Algoritma Dijkstra. Jurnal Sains Komputer & Informatika (J-SAKTI), 3(1), 91–99.
Arif Sudibyo, N., Eka Setyawan, P., & Putra Surya Rahmad Hidayat, Y. (2020). Implementasi Algoritma Dijkstra Dalam Pencarian Rute Terpendek Tempat Wisata Di Kabupaten Klaten. Riemann Research of Mathematics and Mathematics Education, 2(1), 1–9.
Aryanti, R., Fitriani, E., Ardiansyah, D., & Saepudin, A. (2021). Penerapan Metode Rapid Application Development Dalam Pengembangan Sistem Informasi Akademik Berbasis Web. Paradigma - Jurnal Komputer Dan Informatika, 23(2). https://doi.org/10.31294/p.v23i2.11170
Cantona, A., Fauziah, F., & Winarsih, W. (2020). Implementasi Algoritma Dijkstra Pada Pencarian Rute Terpendek ke Museum di Jakarta. Jurnal Teknologi Dan Manajemen Informatika, 6(1), 27–34. https://doi.org/10.26905/jtmi.v6i1.3837
Inayah, A. M., Resti, N. C., & Ilmiyah, N. F. (2023). Analisa Perbandingan Algoritma Floyd-Warshall Dan Algoritma Dijkstrauntuk Penentuan Rute Terdekat. Jurnal Ilmiah Matematika Realistik (JI-MR), 4(2), 146–155.
Lakutu, N. F., Mahmud, S. L., Katili, M. R., & Yahya, N. I. (2023). Algoritma Dijkstra dan Algoritma Greedy Untuk Optimasi Rute Pengiriman Barang Pada Kantor Pos Gorontalo. Euler : Jurnal Ilmiah Matematika, Sains Dan Teknologi, 11(1), 55–65. https://doi.org/10.34312/euler.v11i1.18244
Masri, M., Kiswanto, A. P., & Kusuma, B. S. (2019). Implementasi Algoritma Dijkstra Dalam Perancangan Pariwisata Danau Toba Dan Sekitarnya. Seminar Nasional Teknik (SEMNASTEK) UISU, 221–225.
Ramadhan, G. N., & Bachrun, R. K. A. A. S. (2024). Penerapan algoritma Dijkstra Untuk menentukan Rute Terpendek Tempat Tinggal Ke Kampus 2 Uin Sunan Ampel Surabaya. Indonesian Journal of Business Intelligence, 7(1), 1–6.
Yosua, S., Sigalingging, C., Jipesya, J., & Jumaryadi, Y. (2021). Implementasi Algoritma Dijkstra dalam Pencarian Klinik Hewan Terdekat. Jurnal Ilmiah FIFO, 13(1), 85. https://doi.org/10.22441/fifo.2021.v13i1.009
Zaki, A. (2020). Algoritma Dijkstra : Teori Dan Aplikasinya. Jurnal Matematika UNAND, 6(4), 1. https://doi.org/10.25077/jmu.6.4.1-8.2020