


Paper Title : Nearby Jamu Store Locator Application Using Dijkstra Algorithm
ISSN : 2394-2231
Year of Publication : 2020



MLA Style: Dwi Wulandari Sari, Kurnia Gusti Ayu, Yudo Devianto "Nearby Jamu Store Locator Application Using Dijkstra Algorithm" Volume 7 - Issue 2 March - April,2020 International Journal of Computer Techniques (IJCT) ,ISSN:2394-2231 , www.ijctjournal.org
APA Style: Dwi Wulandari Sari, Kurnia Gusti Ayu, Yudo Devianto "Nearby Jamu Store Locator Application Using Dijkstra Algorithm" Volume 7 - Issue 2 March - April,2020 International Journal of Computer Techniques (IJCT) ,ISSN:2394-2231 , www.ijctjournal.org
Abstract
Jamu is a traditional medicine made from natural herbs that has been passed down as a cultural heritage throughout generations. The demand for jamu continues to increase even today, and it is now served even in star-rated hotels. Jamu gendong is a kind of jamu that is consumed by all kinds of people, from adults to children. However, jamu gendong is often only sold during certain hours, which makes it difficultfor consumers to buy it. This is an issue for those who love drinking jamu, especially for its health benefits. It is difficult to predict whether jamu gendong is in available or not. This study aims to calculate the shortest path from a nearby jamu store from a buyer, using Dijkstra algorithm with directed Graph. From testing conducted using this algorithm, a better distance optimization has been achieved. It is thus expected that this algorithm will help those who are in need of jamu under certain circumstances. The implementation of this research comes in the form of a prototype Android-based application.
Reference
[1] Anisah , N., Ecintia, D., Lukman , A., & Devianto, Y, Android-Based Boarding House Management Information System, International Journal of Computer Techniques-Volume 5 Issue 6, Nov-Dec 2018. [2] Andriati , & Wahjudi., Tingkat Penerimaan Pengunaan Jamu sebagai Alternatif Obat Modern, Journal Masyarakat, Kebudayaan dan pollitik, Vol.29, No.3, 133-145.2016 [3] Fitroh , A., Bachri, O. S., Purnomo, A. I., & Frendianata, I., Shortest Path Finding In Geographical Information Systems Using Node Combination and Dijkstra Algorithm, International Journal of Mechanical Engineering and technology ( IJMET) Vol.9, Isuue 2. [4] Ginting, J. V.,. Aplikasi Penentuan Rute Rumah Sakit Terdekat Menggunakan Algoritma Dijkstra. Jurnal Mantik Penusa, Volume 2, No.2, Desember 2018 [5] Kesehatan, B. L., Laporan hasil riset kesehatan dasar tahun 2010, Jakarta: Badan Litbang Kesehatan. [6] Khoiruddin, H. M., & Khairina , N., Pencarian Jalur Terpendek dengan Algoritma Dijkstra, Sinkron Jurnal&Penelitian Teknik Informatika, Volume 2 Nomor 2, Oktober 2017. [7] Kusuma, E., Jefri, & Agung, H., Aplikasi Perhitungan Dan Visualisai Jarak Terpendek Berdasarkan Data Coordinate Dengan Algoritma Dijkstra Dalam Kasus Pengantaran Barang Di Kawasan Jabodetabek, Jurnal SISFOKOM, Vol.8 No.1.Maret 2019 [8] Malyana , E. ,Pemanfaat Android Dalam Perancangan Aplikasi Kumpulan Doa, Jurnal Sains Dan Informatika, V4.11, 26 April 2018. [9] Masri, M., Kiswanto, A. P., & Kusuma, B. S., Implementasi Algoritma Dijkstra Dalam Perancangan Aplikasi Penentuan Rute Terpendek Pada Objek Pariwisata Danau Toba dan Sekitarnya, SEMNASTEK UISU.2019 [10] Mulyani, eprints.upnjatim.ac.id. Retrieved Novmber 19, 2019, from upnjatim.ac.id: http://eprints.upnjatim.ac.id/1710/1/file_1.pdf. [11] Sunardi, Yudhana, A., & Kadim, A. A., Implementasi Algoritma Dijkstra Untuk Analisis Rute Transportasi Umum Transjogja Berbasis Android, Jurnal Sistem Informasi Bisnis, 9 Mei 2019.
Keywords
Dijkstra, Android, Jamu, Graph