Implementation of the Bellman Ford Method for Searching Community Health Centers in Karanganyar Regency
DOI:
https://doi.org/10.31961/positif.v8i1.1308Keywords:
Bellman Ford Algorithm, Closest Distance, Route Health CentersAbstract
Karanganyar district has 21 health centers. However, the lack of information on the location points makes it difficult for the community to find the nearest health center they want to go to. Delivery of information quickly and precisely is needed in this case. The purpose of this research is the creation of a search application for the shortest route for health centers in Karanganyar district. The method used in this research is the Bellman Ford method. In this implementation, the PHP programming language, MySQL Server, Web, Domain and hosting are used to build the system. The results obtained by this study are the closest route to the destination location on the Google Map, information about the locations of the health center and the nodes that are scattered in Karanganyar Regency.
Downloads
References
[2] R. A. Azdy and F. Darnis, "Implementasi Bellman-Ford untuk Optimasi Rute Pengambilan Sampah di Kota Palembang," Jurnal Nasional Teknik Elektro dan Teknologi Informasi, vol. 8, no. 4, pp. 327-333, 2019.
[3] S. Hamdi and P. , "Analisis Algoritma Dijktra dan Algoritma Bellman-Ford Sebagai Penentuan Jalur Terpendek Menuju Lokasi Kebakaran (Studi Kasus: Kecamatan Praya Kota)," Jurnal Ilmiah Penelitian dan Pembelajaran Informatika (JIPI), vol. 8, no. 1, pp. 26-32, 2018.
[4] A. A. P, S. H. Pramono and M. A. Muslim, "Optimasi Jalur Tercepat dengan Menggunakan Modifikasi Algoritma Bellman Ford (Studi Kasus Lintasan antar Kecamatan Kota Malang)," JEECCIS, vol. 9, no. 2, pp. 168 - 172, 2015.
[5] D. J. Bawole and H. P. Chernovita, "Algoritma Bellman-Ford untuk Menentukan Jalur Terpendek dalam Survey Klaim Asuransi," INOBIS: Jurnal Inovasi Bisnis dan Manajemen Indonesia, vol. 3, no. 1, pp. 41-51, 2019.
[6] M. S. Yusuf, H. M. Az-Zahra and D. H. Apriyanti, "Implementasi Algoritma Dijkstra Dalam Menemukan Jarak Terdekat Dari Lokasi Pengguna Ke Tanaman Yang Di Tuju Berbasis Android (Studi Kasus di Kebun Raya Purwodadi)," Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer, vol. 1, no. 12, pp. 1779-1787, 2017.
[7] F. Anggraini and S. Mingparwoto, "Penerapan Metode Algoritma Bellman-Ford dalam Aplikasi Pencarian Lokasi Perseroan dalam Aplikasi Pencarian Lokasi," Jurnal Teknologi Universitas Muhammadiyah Jakarta, vol. 7, no. 1, pp. 28-34, 2015.
[8] S. Farhan, S. Andryana and N. Hayati, "Implementasi Bellman-Ford dan Floyd-Warshall dalam Menentukan Jalur Terpendek menuju Universitas Nasional Berbasis Android," Jurnal Ilmiah Penelitian dan Pembelajaran Informatika (JIPI), vol. 5, no. 2, pp. 123-132, 2020.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 Sri Siswanti, Renita Febriyanti, Retno Tri Vulandari
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with Positif : Jurnal Sistem dan Teknologi Informasi agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
This work is licensed under a Creative Commons Attribution 4.0 International License.
