Main Article Content

Putri Stepvani
Yosefin Saragi
Irwan Budiman

The development of an area will increase the risk of fire. Fire will not only cause physical, material loss, it can also cause casualties. In a span of 3 years, 46 major fire cases were recorded, not including unregistered fire cases. To be able to reduce the losses incurred, the fire fighters must be able to meet the fire response time of 15 minutes. To be able to meet this response time, a water source that can be used to douse the fire is needed as well as the fastest route to get to the destination point in the shortest possible time. The method used for laying the hydrant is the distribution method using Arc Gis software. The results obtained are that it takes 26 hydrant locations that are scattered in several central business areas and densely populated in the 3 sub-districts.

Keywords: djisktra algorithm route arc gis hydrant fire
Ardyan, S., Mulyono, Suyitno, A. (2017). Implementasi Algoritma Dijkstra Dalam Pencarian Rute Terpendek Tempat Wisata Di Kabupaten Gunung kidul Dengan Program Visual Basic.
Arpanahi, S.K., et all. (2020). International Journal of Electrical Power & Energy Systems (Incorporating flexibility requirements into distribution system expansion planning studies based on regulatory policies).
Broumi, et all. (2016). Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem.
Chen, Y., Zhang, Y., Mahadevan, S. (2011). Fuzzy Dijkstra Algorithm For Shortest Path Problem Under Uncertain Environment.
Fan, D.K., Shi, P. (2010). Improvement of Dijkstra’s Algorithm and Its Application in Route Planning.
Fauzi, A., Mas’ud, M. I. (2019). Proses Manufaktur pada Mesin Primer dan Sekunder CV. Karunia Menggunakan Metode Linier Programming. Journal Knowledge Industrial Engineering(JKIE), 6(2), 59–65.
Hadi, E.I., Iryanto. (2018). Penerapan Algoritma Dijkstra untuk Penentuan Jalur Terbaik EvakuasiTsunami.
Hanik, U., & Mas’ud, M. I. (2019). Perencanaan Inovasi Pengembangan Agrowisata Bukit Flora Dengan Pendekatan Metode Bisnis Model Kanvas. JKIE (Journal Knowledge Industrial Engineering), 6(3), 91-100.
Jafari, H., et all (2020). Finding optimum facility's layout by developed simulated annealing algorithm.
Junaedi, D., Mas’ud, M. I. (2018). Penerapan Metode Forecasting dalam Perencanaan Produksi Bakpia dengan Menggunakan Software POM Guna Memenuhi Permintaan Konsumen. Journal Knowledge Industrial Engineering (JKIE), 5(3), 121–128.
Kusuma, E., Jefri, Agung, H., (2019). Aplikasi Perhitungan Dan Visualisasi Jarak Terpendek Berdasarkan Data Coordinate Dengan Algoritma Dijkstra Dalam Kasus Pengantaran Barang Di Kawasan Jabodetabek.
Lia, T., at all. (2020). Journal of Manufacturing Systems (Using requirement-functional-logical-physical models to support early assembly process planning for complex aircraft systems integration).
Marzouk, M., Othman, A. (2020). Planning utility infrastructure requirements for smart cities using the integration between BIM and GIS.
Nandiroh, S.A., at all. (2013). Implementasi Algoritma Dijkstra Sebagai Solusi Efektif Pembuatan Sistem Bantuan Bencana Real Time.
Nourian, P., at all. (2020). A discrete event simulation procedure for validating programs of requirements: The case of hospital space planning
Peyer, S., et all (2009). A Generalization Of Dijkstra’s Shortest Path Algorithm With Applications To Vlsi Routing.
Rensisu, A. (2009). Perancangan Ulang Instalasi Pipa Sistem Pemadam Kebakran Pada Gedung CCV dan Perkantoran PT. SUMI INDO KABEL, Tbk Daniel Priyo Widodo, Analisis Percabangan Pipa Hydrant Dengan Menggunakan "Program Cae" (2009)
Scalia, G.L., et all (2019). Facility layout problem: Bibliometric and benchmarking analysis.
Shinta S. D. (2017). Analisis Optimalisasi Rute Pemadam Kebarakan Berdasarkan Area Cakupan Pipa Hidran Di Kota Semarang
Silva, J.M., Silva, J.R. (2019). A New Hierarchical Approach To Requirement Analysis Of Problems In Automated Planning.