Penggunaan Algoritma Dijkstra untuk Berbagai Masalah: Mini Review

Keywords:

Algoritma Dijkstra, jarak terpendek, rute terpendek

Abstract

Abstrak

Algoritma yang cocok digunakan dalam menentukan jarak terpendek ke suatu lokasi, salah satunya berupa Algoritma Dijkstra. Algoritma Dijkstra merupakan jenis Algoritma greedy yang mengonsep dalam menentukan layanan minimum pada beberapa rute yang tersedia dan menghasilkan kumpulan solusi rute terpendek. Penerapan Algoritma Dijkstra dapat digunakan dalam berbagai bidang. Algoritma Dijkstra dapat menawarkan pilihan rute yang terdaftar dalam sistem, kemudian sistem akan memproses jarak terdekat yang dapat ditempuh dengan menampilkan peta kepada user. Kami berusaha menghimpun beberapa penelitian terkait penerapan Algoritma Dijkstra untuk menyelesaikan berbagai masalah, sehingga diharapkan tulisan ini dapat bermanfaat untuk para peneliti yang hendak mengimplementasi Algoritma Dijkstra untuk berbagai bidang, seperti penyelesaian biobjective shortest path, penentuan jalur multi-objective, graf Dijkstra, evakuasi darurat, permasalahan fuzzy, integrasi dengan fitur location-based service (LBS), dan distribusi rute optimal.

Abstract

Algorithms that are suitable to be used in determining the shortest distance to a location, is the Dijkstra Algorithm. Dijkstra Algorithm is a greedy algorithm which conceptualizes the minimum service on several available routes and produces a

collection of the shortest route solutions. Implementation of Dijkstra's Algorithm can be used in various fields. Dijkstra algorithm offered a choice of routes that are registered in the system, it will process the closest distance that can be reached by map view. We try to collect several studies that apply the Dijkstra Algorithm for various problems solving, this paper can be useful for researchers who want to implement Dijkstra Algorithm for various fields, such as solving biobjective shortest paths, determining multi-objective paths, Dijkstra's graphs, emergency evacuation, fuzzy problems, integration with location-based service (LBS) features, and optimal route distribution.

References

Abbas, A. H., Habelalmateen, M. I., Jurdi, S., Audah, L., & Alduais, N. A. M. (2019). GPS based location monitoring system with geo-fencing capabilities. AIP Conference Proceedings, 2173, 20004. https://doi.org/10.1063/1.5133929

Ahmed, A. M. (2020). Designing a Framework to Control ?the Spread of Covid-19 by Utilizing ?Cellular System. Kurdistan Journal of Applied Research, 5(3), 146–153. https://doi.org/10.24017/covid.16

Al Hakim, R. R., Billian, M. Y., & Muchsin, A. (2020). Pendekatan Postulat Jarak Terdekat Rumah Sakit Rujukan Covid-19 di Keresidenan Surakarta Indonesia Menggunakan Haversine Formula. SEMASTER: Seminar Nasional Teknologi Informasi & Ilmu Komputer, 1(1), 103–111. https://doi.org/10.31849/semaster.v1i1

Alsaqer, M., Hilton, B., Horan, T., & Aboulola, O. (2015). Performance Assessment of Geo-triggering in Small Geo-fences: Accuracy, Reliability, and Battery Drain in Different Tracking Profiles and Trigger Directions. Procedia Engineering, 107, 337–348. https://doi.org/10.1016/j.proeng.2015.06.090

Ariyanto, R., Watequlis Syaifudin, Y., Puspitasari, D., Yuli Ananta, A., Setiawan, A., & Rohadi, E. (2019). A Web and Mobile GIS for Identifying Areas within the Radius Affected by Natural Disasters Based on OpenStreetMap Data. International Journal of Online and Biomedical Engineering (IJOE), 15(15), 80–95. https://doi.org/10.3991/ijoe.v15i15.11507

Bento, L. M. S., Boccardo, D. R., Machado, R. C. S., Miyazawa, F. K., Pereira de Sá, V. G., & Szwarcfiter, J. L. (2019). Dijkstra graphs. Discrete Applied Mathematics, 261, 52–62. https://doi.org/10.1016/j.dam.2017.07.033

Chen, Y. Z., Shen, S. F., Chen, T., & Yang, R. (2014). Path optimization study for vehicles evacuation based on Dijkstra algorithm. Procedia Engineering, 71, 159–165. https://doi.org/10.1016/j.proeng.2014.04.023

Deng, Y., Chen, Y., Zhang, Y., & Mahadevan, S. (2012). Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment. Applied Soft Computing Journal, 12(3), 1231–1237. https://doi.org/10.1016/j.asoc.2011.11.011

Farid, & Yunus, Y. (2017). Analisa Algoritma Haversine Formula untuk Pencarian Lokasi Terdekat Rumah Sakit dan Puskesmas Provinsi Gorontalo. ILKOM Jurnal Ilmiah, 9(3), 353–355.

Garzon, S. R., Arbuzin, D., & Kupper, A. (2017). Geofence index: A performance estimator for the reliability of proactive location-based services. Proceedings - 18th IEEE International Conference on Mobile Data Management, MDM 2017, 1–10. https://doi.org/10.1109/MDM.2017.12

Husada, C., Hartomo, K. D., & Chernovita, H. P. (2020). Implementasi Haversine Formula untuk Pembuatan SIG Jarak Terdekat ke RS Rujukan COVID-19. Jurnal RESTI, 4(5), 874–883.

Liu, S., Jiang, H., Chen, S., Ye, J., He, R., & Sun, Z. (2020). Integrating Dijkstra’s algorithm into deep inverse reinforcement learning for food delivery route planning. Transportation Research Part E: Logistics and Transportation Review, 142(May), 102070. https://doi.org/10.1016/j.tre.2020.102070

Mirahadi, F., & McCabe, B. Y. (2020). EvacuSafe: A real-time model for building evacuation based on Dijkstra’s algorithm. Journal of Building Engineering, June, 101687. https://doi.org/10.1016/j.jobe.2020.101687

Pramudhita, A. N., Suyono, H., & Yudaningtyas, E. (2015). Penggunaan Algoritma Multi Criteria Decision Making dengan Metode Topsis dalam Penempatan Karyawan. Jurnal EECCIS, 9(1), 91–94.

Putri, A. O., Ali, M. A. M., Saad, M., & Hidayat, S. S. (2018). Wearable sensor and internet of things technology for better medical science: A review. International Journal of Engineering and Technology(UAE), 7(4), 1–4. https://doi.org/10.14419/ijet.v7i4.11.20677

Qomaruddin, M., Alawy, M. T., & Sugiono, S. (2018). Perancangan Aplikasi Penentu Rute Terpendek Perjalanan Wisata di Kabupaten Jember Menggunakan Algoritma Dijkstra. Science Electro, 6(2), 31–39.

Rosita, Y. D., Rosyida, E. E., & Rudiyanto, M. A. (2019). Implementation of dijkstra algorithm and multi-criteria decision-making for optimal route distribution. Procedia Computer Science, 161, 378–385. https://doi.org/10.1016/j.procs.2019.11.136

Saputra, K., Nazaruddin, N., Yunardi, D. H., & Andriyani, R. (2019). Implementation of haversine formula on location based mobile application in syiah kuala university. Proceedings: CYBERNETICSCOM 2019 - 2019 IEEE International Conference on Cybernetics and Computational Intelligence: Towards a Smart and Human-Centered Cyber World, 40–45. https://doi.org/10.1109/CYBERNETICSCOM.2019.8875686

Sedeño-noda, A., & Colebrook, M. (2019). A biobjective Dijkstra algorithm. European Journal of Operational Research, 276(1), 106–118. https://doi.org/10.1016/j.ejor.2019.01.007

Suryana, A., Reynaldi, F., Pratama, F., Ginanjar, G., Indriansyah, I., & Hasman, D. (2019). Implementation of haversine formula on the limitation of e-voting radius based on android. Proceedings - 2018 4th International Conference on Computing, Engineering, and Design, ICCED 2018, 218–223. https://doi.org/10.1109/ICCED.2018.00050

Wahyuningsih, D., & Syahreza, E. (2018). Shortest Path Search Futsal Field Location With Dijkstra Algorithm. IJCCS (Indonesian Journal of Computing and Cybernetics Systems), 12(2), 161. https://doi.org/10.22146/ijccs.34513

Wang, H., Mao, W., & Eriksson, L. (2019). A Three-Dimensional Dijkstra’s algorithm for multi-objective ship voyage optimization. Ocean Engineering, 186(May), 106131. https://doi.org/10.1016/j.oceaneng.2019.106131

Wang, S. X. (2012). The improved Dijkstra’s shortest path algorithm and its application. Procedia Engineering, 29, 1186–1190. https://doi.org/10.1016/j.proeng.2012.01.110

Penggunaan Algoritma Dijkstra untuk Berbagai Masalah: Mini Review

Keywords:

Abstract

References

Downloads

Posted

License