Safest and Shortest Exit Algorithm for NPP Fire Evacuation

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.