Fastest Route for Public Health Center in Bandung with Dijkstra Algorithm and FP-Growth Recommendation in C++ Programming Language

Andika Eka Kurnia, Gregorius Christian Sunaryo, Muhammad Rafi Zamzami, Naila Melany, Rafi Nazhmi Nugraha, Rahma Dina Ariyanti

Abstract


This research addresses the need for efficient public health center access in Bandung. In this case study, the solution to that specific problem is implemented using the C++ programming language. Consequently, extreme programming is chosen as the research methodology. We implemented Dijkstra's algorithm to find the shortest routes and the FP-Growth algorithm to recommend frequently visited health centers based on previous history. By leveraging C++ for its performance advantages, the system maps urban villages and calculates optimal paths. Additional features manage village data, create routes, and display health center information. The combined use of these algorithms enhances navigation and healthcare access in urban settings, though future work should consider real-time traffic conditions.


Keywords


Graph; Dijkstra Algorithm; FP-Growth Algorithm; C++ Programming Language; Public Health Center in Bandung;

Full Text:

PDF

References


Roseandree, B. S., Mulyana, A. J., Fuji, R., Pratama, A. H., & Purnama, P. Searching for the Fastest Route to Tourist Attractions with the Kruskal Algorithm in the C++ Programming Language. Journal of Software Engineering, Information and Communication Technology (SEICT), 4(2), 139-150.

Srikant, R., & Agrawal, R. (1995). Mining generalized association rules.

Goodrich, M. T., Tamassia, R., & Mount, D. M. (2011). Data structures and algorithms in C++. John Wiley & Sons.

Septiani, N. A., & Habibie, F. Y. (2022). Penggunaan Metode Extreme Programming Pada Perancangan Sistem Informasi Pelayanan Publik. Jurnal Sistem Komputer dan Informatika, 3(3), 341-349. https://www.ejurnal.stmik-budidarma.ac.id/index.php/JSON/article/view/3931/2607

Taufikurrachman, H., Huda, M. N., Satrio P. P, M. R., & M, M. H. (2020, April 30). Konsep Lintasan Terpendek algoritma dijkstra. YouTube. https://www.youtube.com/watch?v=qIzCYrE8570

Anwar, B., Ambiyar, & Fadhliah. (2023). Application of the FP-Growth method to determine drug sales patterns. Sinkron: Jurnal dan Penelitian Teknik Informatika, 7(1). https://doi.org/10.33395/sinkron.v8i1.12004

Czeisler, M. É., Marynak, K., Clarke, K. E., et al. (2020). Delay or avoidance of medical care because of COVID-19–related concerns — United States, June 2020. MMWR Morbidity and Mortality Weekly Report, 69(1250–1257). https://doi.org/10.15585/mmwr.mm6936a4

Sipayung, L. Y., Sinaga, C. R., & Sagala, A. C. (2023). Application of Dijkstra’s algorithm to determine the shortest route from city center to Medan city tourist attractions. Journal of Computer Networks, Architecture and High Performance Computing, 5(2). https://doi.org/10.47709/cnahpc.v5i2.2699

Syed, S. T., Gerber, B. S., & Sharp, L. K. (2013). Traveling towards disease: transportation barriers to health care access. Journal of community health, 38(5), 976–993. https://doi.org/10.1007/s10900-013-9681-1




DOI: https://doi.org/10.17509/seict.v5i1.71212

Refbacks

  • There are currently no refbacks.


Copyright (c) 2024 Journal of Software Engineering, Information and Communication Technology (SEICT)

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Journal of Software Engineering, Information and Communicaton Technology (SEICT), 
(e-ISSN:2774-1699 | p-ISSN:2744-1656) published by Program Studi Rekayasa Perangkat Lunak, Kampus UPI di Cibiru.


 Indexed by.