A platform for research: civil engineering, architecture and urbanism
Perancangan Jalur Evakuasi Kebakaran PT. PCC dengan Metode Algoritma Dijkstra
Fires can occur at any time, therefore a mechanism is needed to evacuate the building in the event of a disaster. Generally, public facilities provide instructions and evacuation routes for exiting the building. PT. PCC has its headquarters in Australia. As for PT. PCC also opened a new factory located in Gresik Regency, East Java. The new factory does not yet have adequate fire evacuation routes. Even though inside the building there are materials and equipment that are flammable. Based on this, this research aims to design fire evacuation routes in PT buildings. PCC Gresik. The type of research used in this research is quantitative research. The method that the author applies is the Djikstra Algorithm to determine the shortest proposed route. The design of the evacuation route has 2 gathering points, namely at the front and back. There are 22 evacuation route signs, 6 exit signs, 2 gathering point signs, 2 emergency telephone signs and 10 Light Fire Extinguisher (APAR) signs. Evacuation route signs, exit signs and Light Fire Extinguisher (APAR) signs are planned to be installed on the walls. Assembly point signs and emergency telephone signs are installed on poles.
Perancangan Jalur Evakuasi Kebakaran PT. PCC dengan Metode Algoritma Dijkstra
Fires can occur at any time, therefore a mechanism is needed to evacuate the building in the event of a disaster. Generally, public facilities provide instructions and evacuation routes for exiting the building. PT. PCC has its headquarters in Australia. As for PT. PCC also opened a new factory located in Gresik Regency, East Java. The new factory does not yet have adequate fire evacuation routes. Even though inside the building there are materials and equipment that are flammable. Based on this, this research aims to design fire evacuation routes in PT buildings. PCC Gresik. The type of research used in this research is quantitative research. The method that the author applies is the Djikstra Algorithm to determine the shortest proposed route. The design of the evacuation route has 2 gathering points, namely at the front and back. There are 22 evacuation route signs, 6 exit signs, 2 gathering point signs, 2 emergency telephone signs and 10 Light Fire Extinguisher (APAR) signs. Evacuation route signs, exit signs and Light Fire Extinguisher (APAR) signs are planned to be installed on the walls. Assembly point signs and emergency telephone signs are installed on poles.
Perancangan Jalur Evakuasi Kebakaran PT. PCC dengan Metode Algoritma Dijkstra
Raditya Azis (author) / Bekti Nugrahadi (author) / Anita Oktaviana Trisna Devi (author) / Yunita Primasanti (author)
2024-08-13
doi:10.55606/jtmei.v3i3.4208
Jurnal Teknik Mesin, Industri, Elektro dan Informatika; Vol. 3 No. 3 (2024): September : JURNAL TEKNIK MESIN, INDUSTRI, ELEKTRO DAN INFORMATIKA; 199-212 ; 2963-7805 ; 2963-8208 ; 10.55606/jtmei.v3i3
Article (Journal)
Electronic Resource
English
DDC:
624
Aplikasi Algoritma Branch and Bound Untuk Optimasi Jalur Pemadam Kebakaran Kota Yogyakarta
DOAJ | 2014
|