Safest and Shortest Exit Algorithm for NPP Fire Evacuation

Amany Fouad Abd El-Aal; Adel Zaglool; Magy Mohamed Kandil

doi:doi:10.11648/j.ae.20210501.16

| Peer-Reviewed

Safest and Shortest Exit Algorithm for NPP Fire Evacuation

Amany Fouad Abd El-Aal, Adel Zaglool, Magy Mohamed Kandil

Published in Applied Engineering (Volume 5, Issue 1)

Received: 3 April 2021 Accepted: 23 April 2021 Published: 30 April 2021

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

Fire safety in nuclear power plants (NPPs) is very important for realizing a high level of safety which investigate achievement reasonably protection for persons and the environment since fire can cause core melts thus emergency fire evacuations are concerned in NPPs. In this research, a new algorithm for Emergency fire evacuation is developed to minimize evacuation time for limiting the evacuee’s exposure to fire hazards products. The developed algorithm is a Safest Shortest Exit algorithm (SSE) which consists of three techniques: a rules-based to recognize the safest route, Distance Vector Hop (DV-Hop) localization to determine evacuee's location, and Dijkstra to produce the shortest route. The developed SSE is simulated for protecting the persons inside NPP buildings through three stages. Validation of the developed SSE algorithm is realised through simulation fire scenario inside a standard Main Control Room (MCR) in a Nuclear Power Plant as realistic fire scenario using the Consolidated Model of Fire Growth and Smoke Transport (CFAST) as fire zone model. CFAST produces output fire data that used by SSE to create the exit map for safest and shortest route for evacuees. The Results of the simulation represent that the developed algorithm can produce the safest and shortest evacuation route within minimum evacuation time in form of a clear tree graph.

Published in	Applied Engineering (Volume 5, Issue 1)
DOI	10.11648/j.ae.20210501.16
Page(s)	14-21
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2021. Published by Science Publishing Group

Keywords

Emergency Fire Evacuation, a Standard Main Control Room, Safest and Shortest Route, NPP Fire Evacuation, DV-Hop Localization Technique, CFAST Model, Dijkstra Algorithm

References

[1]	Z. Hua, and W. Shuhong, "Technical Insights of SSR-2/1 Safety of Nuclear Power Plants: Design (Rev. 1)."
[2]	U. NRc, “NUREG 1150-Severe accident risks: an assessment for five US nuclear power plants,” Division of Systems Research, Office of Nuclear Regulatory Research, US Nuclear Regulatory Commission, Washington, DC, 1990.
[3]	J.-j. Li, and H.-y. Zhu, “A risk-based model of evacuation route optimization under fire,” Procedia engineering, vol. 211, pp. 365-371, 2018.
[4]	M. Choi, and S. Chi, “Optimal route selection model for fire evacuations based on hazard prediction data,” Simulation Modelling Practice and Theory, vol. 94, pp. 321-333, 2019.
[5]	A. V. Goldberg, and C. Harrelson, "Computing the shortest path: A search meets graph theory." pp. 156-165.
[6]	N. A. M. Sabri, A. S. H. Basari, B. Husin, and K. A. F. A. Samah, “Simulation method of shortest and safest path algorithm for evacuation in high rise building,” Applied Mathematical Sciences, vol. 8, no. 104, pp. 5163-5172, 2014.
[7]	Y.-z. Chen, S.-f. Shen, T. Chen, and R. Yang, “Path optimization study for vehicles evacuation based on Dijkstra algorithm,” Procedia Engineering, vol. 71, pp. 159-165, 2014.
[8]	D. Liu, T. Gu, and J.-P. Xue, "Rule engine based on improvement rete algorithm." pp. 346-349.
[9]	K. Chen, Z.-h. Wang, M. Lin, and M. Yu, “An improved DV-Hop localization algorithm for wireless sensor networks,” 2010.
[10]	B. Golden, “Shortest-path algorithms: A comparison,” Operations Research, vol. 24, no. 6, pp. 1164-1168, 1976.
[11]	R. D. Peacock, K. B. McGrattan, G. P. Forney, and P. A. Reneke, CFAST–Consolidated Model of Fire Growth and Smoke Transport (Version 7) Volume 1: Technical Reference Guide, 2015.
[12]	W. D. Walton, D. J. Carpenter, and C. B. Wood, "Zone computer fire models for enclosures," SFPE handbook of fire protection engineering, pp. 1024-1033: Springer, 2016.
[13]	G. Rein, A. Bar-Ilan, A. C. Fernandez-Pello, and N. Alvares, “A comparison of three models for the simulation of accidental fires,” Journal of Fire Protection Engineering, vol. 16, no. 3, pp. 183-209, 2006.
[14]	J. Fonollosa, A. Solórzano, and S. Marco, “Chemical sensor systems and associated algorithms for fire detection: A review,” Sensors, vol. 18, no. 2, pp. 553, 2018.
[15]	U. N. R. C. D. o. H. F. Safety, Guidelines for control room design reviews: Division of Human Factors Safety, Office of Nuclear Reactor Regulation, US …, 1981.
[16]	U. NRC, “Verification and validation of selected fire models for nuclear power plant applications,” NUREG-1824 (EPRI 1011999), 2007.
[17]	V. Babrauskas, Ignition handbook: Fire science publishers: Issaquah, WA, 2003.
[18]	D. A. Purser, J. A. Rowley, P. J. Fardell, and M. Bensilum, “Fully enclosed design fires for hazard assessment in relation to yields of carbon monoxide and hydrogen cyanide,” Proceedings of Interflam’99, vol. 8, 1999.
[19]	C. Afshar, B. Najafi, F. Joglar, Y. Li, D. Henneke, M. Warner, J. Hyslop, J. Kratchman, and N. Siu, “Fire Probabilistic Risk Assessment Technique Enhancements: Supplement 1 to NUREG/CR-6850 and EPRI 1011989,” EPRI and NRC, 2010.
[20]	A. Ojugo, A. Eboka, O. Okonta, R. Yoro, and F. Aghware, “Genetic algorithm rule-based intrusion detection system (GAIDS),” Journal of Emerging Trends in Computing and Information Sciences, vol. 3, no. 8, pp. 1182-1194, 2012.
[21]	S. Kumar, and D. Lobiyal, “An advanced DV-Hop localization algorithm for wireless sensor networks,” Wireless personal communications, vol. 71, no. 2, pp. 1365-1385, 2013.
[22]	Y. Huang, "Research on the Improvement of Dijkstra Algorithm in the Shortest Path Calculation."
[23]	E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische mathematik, vol. 1, no. 1, pp. 269-271, 1959.
[24]	M. J. Hurley, D. T. Gottuk, J. R. Hall Jr, K. Harada, E. D. Kuligowski, M. Puchovsky, J. M. Watts Jr, and C. J. WIECZOREK, SFPE handbook of fire protection engineering: Springer, 2015.

Cite This Article

Plain Text BibTeX RIS

APA Style

Amany Fouad Abd El-Aal, Adel Zaglool, Magy Mohamed Kandil. (2021). Safest and Shortest Exit Algorithm for NPP Fire Evacuation. Applied Engineering, 5(1), 14-21. https://doi.org/10.11648/j.ae.20210501.16

Copy | Download

ACS Style

Amany Fouad Abd El-Aal; Adel Zaglool; Magy Mohamed Kandil. Safest and Shortest Exit Algorithm for NPP Fire Evacuation. Appl. Eng. 2021, 5(1), 14-21. doi: 10.11648/j.ae.20210501.16

Copy | Download

AMA Style

Amany Fouad Abd El-Aal, Adel Zaglool, Magy Mohamed Kandil. Safest and Shortest Exit Algorithm for NPP Fire Evacuation. Appl Eng. 2021;5(1):14-21. doi: 10.11648/j.ae.20210501.16

Copy | Download

@article{10.11648/j.ae.20210501.16,
  author = {Amany Fouad Abd El-Aal and Adel Zaglool and Magy Mohamed Kandil},
  title = {Safest and Shortest Exit Algorithm for NPP Fire Evacuation},
  journal = {Applied Engineering},
  volume = {5},
  number = {1},
  pages = {14-21},
  doi = {10.11648/j.ae.20210501.16},
  url = {https://doi.org/10.11648/j.ae.20210501.16},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ae.20210501.16},
  abstract = {Fire safety in nuclear power plants (NPPs) is very important for realizing a high level of safety which investigate achievement reasonably protection for persons and the environment since fire can cause core melts thus emergency fire evacuations are concerned in NPPs. In this research, a new algorithm for Emergency fire evacuation is developed to minimize evacuation time for limiting the evacuee’s exposure to fire hazards products. The developed algorithm is a Safest Shortest Exit algorithm (SSE) which consists of three techniques: a rules-based to recognize the safest route, Distance Vector Hop (DV-Hop) localization to determine evacuee's location, and Dijkstra to produce the shortest route. The developed SSE is simulated for protecting the persons inside NPP buildings through three stages. Validation of the developed SSE algorithm is realised through simulation fire scenario inside a standard Main Control Room (MCR) in a Nuclear Power Plant as realistic fire scenario using the Consolidated Model of Fire Growth and Smoke Transport (CFAST) as fire zone model. CFAST produces output fire data that used by SSE to create the exit map for safest and shortest route for evacuees. The Results of the simulation represent that the developed algorithm can produce the safest and shortest evacuation route within minimum evacuation time in form of a clear tree graph.},
 year = {2021}
}

Copy | Download

TY  - JOUR
T1  - Safest and Shortest Exit Algorithm for NPP Fire Evacuation
AU  - Amany Fouad Abd El-Aal
AU  - Adel Zaglool
AU  - Magy Mohamed Kandil
Y1  - 2021/04/30
PY  - 2021
N1  - https://doi.org/10.11648/j.ae.20210501.16
DO  - 10.11648/j.ae.20210501.16
T2  - Applied Engineering
JF  - Applied Engineering
JO  - Applied Engineering
SP  - 14
EP  - 21
PB  - Science Publishing Group
SN  - 2994-7456
UR  - https://doi.org/10.11648/j.ae.20210501.16
AB  - Fire safety in nuclear power plants (NPPs) is very important for realizing a high level of safety which investigate achievement reasonably protection for persons and the environment since fire can cause core melts thus emergency fire evacuations are concerned in NPPs. In this research, a new algorithm for Emergency fire evacuation is developed to minimize evacuation time for limiting the evacuee’s exposure to fire hazards products. The developed algorithm is a Safest Shortest Exit algorithm (SSE) which consists of three techniques: a rules-based to recognize the safest route, Distance Vector Hop (DV-Hop) localization to determine evacuee's location, and Dijkstra to produce the shortest route. The developed SSE is simulated for protecting the persons inside NPP buildings through three stages. Validation of the developed SSE algorithm is realised through simulation fire scenario inside a standard Main Control Room (MCR) in a Nuclear Power Plant as realistic fire scenario using the Consolidated Model of Fire Growth and Smoke Transport (CFAST) as fire zone model. CFAST produces output fire data that used by SSE to create the exit map for safest and shortest route for evacuees. The Results of the simulation represent that the developed algorithm can produce the safest and shortest evacuation route within minimum evacuation time in form of a clear tree graph.
VL  - 5
IS  - 1
ER  -

Copy | Download

Author Information

Amany Fouad Abd El-Aal

Egyptian Nuclear and Radiological Regulatory Authority, Cairo, Egypt
Adel Zaglool

Electronic and Communication Department, Faculty of Engineering, Zagazig University, (Current in Delta University), Gamasa, Egypt
Magy Mohamed Kandil

Egyptian Nuclear and Radiological Regulatory Authority, Cairo, Egypt

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Amany Fouad Abd El-Aal, Adel Zaglool, Magy Mohamed Kandil. (2021). Safest and Shortest Exit Algorithm for NPP Fire Evacuation. Applied Engineering, 5(1), 14-21. https://doi.org/10.11648/j.ae.20210501.16

Copy | Download

ACS Style

Amany Fouad Abd El-Aal; Adel Zaglool; Magy Mohamed Kandil. Safest and Shortest Exit Algorithm for NPP Fire Evacuation. Appl. Eng. 2021, 5(1), 14-21. doi: 10.11648/j.ae.20210501.16

Copy | Download

AMA Style

Amany Fouad Abd El-Aal, Adel Zaglool, Magy Mohamed Kandil. Safest and Shortest Exit Algorithm for NPP Fire Evacuation. Appl Eng. 2021;5(1):14-21. doi: 10.11648/j.ae.20210501.16

Copy | Download

@article{10.11648/j.ae.20210501.16,
  author = {Amany Fouad Abd El-Aal and Adel Zaglool and Magy Mohamed Kandil},
  title = {Safest and Shortest Exit Algorithm for NPP Fire Evacuation},
  journal = {Applied Engineering},
  volume = {5},
  number = {1},
  pages = {14-21},
  doi = {10.11648/j.ae.20210501.16},
  url = {https://doi.org/10.11648/j.ae.20210501.16},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ae.20210501.16},
  abstract = {Fire safety in nuclear power plants (NPPs) is very important for realizing a high level of safety which investigate achievement reasonably protection for persons and the environment since fire can cause core melts thus emergency fire evacuations are concerned in NPPs. In this research, a new algorithm for Emergency fire evacuation is developed to minimize evacuation time for limiting the evacuee’s exposure to fire hazards products. The developed algorithm is a Safest Shortest Exit algorithm (SSE) which consists of three techniques: a rules-based to recognize the safest route, Distance Vector Hop (DV-Hop) localization to determine evacuee's location, and Dijkstra to produce the shortest route. The developed SSE is simulated for protecting the persons inside NPP buildings through three stages. Validation of the developed SSE algorithm is realised through simulation fire scenario inside a standard Main Control Room (MCR) in a Nuclear Power Plant as realistic fire scenario using the Consolidated Model of Fire Growth and Smoke Transport (CFAST) as fire zone model. CFAST produces output fire data that used by SSE to create the exit map for safest and shortest route for evacuees. The Results of the simulation represent that the developed algorithm can produce the safest and shortest evacuation route within minimum evacuation time in form of a clear tree graph.},
 year = {2021}
}

Copy | Download

TY  - JOUR
T1  - Safest and Shortest Exit Algorithm for NPP Fire Evacuation
AU  - Amany Fouad Abd El-Aal
AU  - Adel Zaglool
AU  - Magy Mohamed Kandil
Y1  - 2021/04/30
PY  - 2021
N1  - https://doi.org/10.11648/j.ae.20210501.16
DO  - 10.11648/j.ae.20210501.16
T2  - Applied Engineering
JF  - Applied Engineering
JO  - Applied Engineering
SP  - 14
EP  - 21
PB  - Science Publishing Group
SN  - 2994-7456
UR  - https://doi.org/10.11648/j.ae.20210501.16
AB  - Fire safety in nuclear power plants (NPPs) is very important for realizing a high level of safety which investigate achievement reasonably protection for persons and the environment since fire can cause core melts thus emergency fire evacuations are concerned in NPPs. In this research, a new algorithm for Emergency fire evacuation is developed to minimize evacuation time for limiting the evacuee’s exposure to fire hazards products. The developed algorithm is a Safest Shortest Exit algorithm (SSE) which consists of three techniques: a rules-based to recognize the safest route, Distance Vector Hop (DV-Hop) localization to determine evacuee's location, and Dijkstra to produce the shortest route. The developed SSE is simulated for protecting the persons inside NPP buildings through three stages. Validation of the developed SSE algorithm is realised through simulation fire scenario inside a standard Main Control Room (MCR) in a Nuclear Power Plant as realistic fire scenario using the Consolidated Model of Fire Growth and Smoke Transport (CFAST) as fire zone model. CFAST produces output fire data that used by SSE to create the exit map for safest and shortest route for evacuees. The Results of the simulation represent that the developed algorithm can produce the safest and shortest evacuation route within minimum evacuation time in form of a clear tree graph.
VL  - 5
IS  - 1
ER  -

Copy | Download