Rancang Bangun Sistem Penentuan Jalur Evakuasi Keluar Gedung Rumah Sakit Saat Kondisi Darurat Menggunakan Algoritma Dijkstra Dengan Antrian Prioritas
Main Article Content
Abstract
Disaster is a sudden event, such as an accident or a natural catastrophe, that causes great damage or loss of life. Disasters can occur at any time, therefore a mechanism is needed to evacuate out of the building during a disaster. Generally public facilities have provided instructions and evacuation routes outside the building. Based on the severity of the disaster and the evacuation capability of the victim, the evacuation strategy can range from evacuation as soon as possible, evacuate slowly, move to a safe location inside the building or take refuge in the available protection room and wait for the rescue team to arrive.
The algorithm for finding the shortest paths can be used to determine the evacuation route. But this path is still static, if the route damaged in then the evacuation route would become useless. The time for the evacuation process can also increase if the condition of the evacuation route is not known whether damaged or not. The solution to solve this problem is to make a system that can help find the safest and shortest evacuation routes during emergencies. This system consist of microcontroller Arduino Mega to control the system and led for evacuation sign. The evacuation routes is determined by implementing dijkstra algorithm with priority queue to search the shortest path.
Downloads
Article Details
Please find the rights and licenses in the Journal of Information Technology and Computer Engineering (JITCE).
1. License
The non-commercial use of the article will be governed by the Creative Commons Attribution license as currently displayed on Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
2. Author(s)’ Warranties
The author(s) warrants that the article is original, written by stated author(s), has not been published before, contains no unlawful statements, does not infringe the rights of others, is subject to copyright that is vested exclusively in the author and free of any third party rights, and that any necessary permissions to quote from other sources have been obtained by the author(s).
3. User Rights
JITCE adopts the spirit of open access and open science, which disseminates articles published as free as possible under the Creative Commons license. JITCE permits users to copy, distribute, display, and perform the work for non-commercial purposes only. Users will also need to attribute authors and JITCE on distributing works in the journal.
4. Rights of Authors
Authors retain the following rights:
- Copyright, and other proprietary rights relating to the article, such as patent rights,
- the right to use the substance of the article in future own works, including lectures and books,
- the right to reproduce the article for own purposes,
- the right to self-archive the article.
- the right to enter into separate, additional contractual arrangements for the non-exclusive distribution of the article's published version (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal (Journal of Information Technology and Computer Engineering).
5. Co-Authorship
If the article was jointly prepared by other authors; upon submitting the article, the author is agreed on this form and warrants that he/she has been authorized by all co-authors on their behalf, and agrees to inform his/her co-authors. JITCE will be freed on any disputes that will occur regarding this issue.
7. Royalties
By submitting the articles, the authors agreed that no fees are payable from JITCE.
8. Miscellaneous
JITCE will publish the article (or have it published) in the journal if the article’s editorial process is successfully completed and JITCE or its sublicensee has become obligated to have the article published. JITCE may adjust the article to a style of punctuation, spelling, capitalization, referencing and usage that it deems appropriate. The author acknowledges that the article may be published so that it will be publicly accessible and such access will be free of charge for the readers.
References
[2] Abrahams, John. 1994. Chapter 6: Fire escape in difficult circumstances. In Stollard, Paul; Johnston, Lawrence. Design against fire: Introduction to Fire Safety Engineering Design. Chapman & Hall
[3] Keputusan Menteri Kesehatan RI. No.228/Menkes/SK/1/1995 tentang Pembentukan Tim Kesehatan Penanggulangan Korban Bencana di setiap rumah sakit
[4] Keputusan Menteri Kesehatan. KEPMENAKES 1087 MENKES / SK / VIII / 2010. Tentang Standar Kesehatan dan Keselamatan Kerja di Rumah Sakit.
[5] Kementrian Kesehatan RI. 2012. Pedoman Teknis Bangunan Rumah Sakit Yang Aman Dalam Situasi Darurat dan Bencana.
[6] Iftadi Irwan, dkk. Perancangan Peta Evakuasi Menggunakan Algoritma Floyd-Warshall untuk penentuan lintasan terpendek. Universitas sebelas maret: Surakarta. Jurnal Performa Vol. 10 No.2, 2011, hal. 95-104.
[7] Munir, Rinaldi. 2010. Matematika Diskrit. Bandung:Informatika
[8] Dewi, Luh Joni Erawati. 2010. Pencarian Rute Terpendek Tempat Wisata di Bali Dengan Menggunakan Algoritma Dijkstra. Universitas Pendidikan Ganesha:Yogyakarta.
[9] Zhan, F. Benjamin. 1997. Three Fastest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures. Universitas Southwest Texas State:San Marcos
[10] T. Husna, D. Ichwana, dan Kasoep. Werman, �SISTEM PENGATUR IRIGASI SAWAH MENGGUNAKAN METODE,� Journal of Information Technology and Computer Engineering IRIGASI ALTERNATE WETTING AND DRYING BERBASIS TEKNOLOGI INTERNET OF THINGS, vol. 02, pp. 42-50, 2018.
[11] O. Octaviany, B. Rahmadya dan R. E. Putri, �Sistem Peringatan Dini Bencana Longsor Menggunakan Sensor Accelerometer dan Sensor Kelembabapan Tanah Berbasis Android,� Journal of Information Technology and Computer Engineering, vol. 02, pp. 14-20, 2018.
[12] Andesta, D., & Ferdian, R. (2018, September 29). Sistem Keamanan Sepeda Motor Berbasis Mikrokontroler dan Modul GSM. Journal of Information Technology and Computer Engineering, 2(02), 51-63.