The Best Way to Find an Evacuation Route for Fire Emergency

Abstract

Evacuation route planning for urban area is important in a natural or man-made disaster. Fires in urban area have been one of the most dangerous problems in developing countries such as Myanmar. It is needed to develop effective planning to response and rescue in time locally everywhere because damage properties of fires have increased in present day. This paper presents an offline evacuation route planning method to provide for rescue schemes as fast as possible without the internet. The proposed algorithm calculates the shortest route between the nearest fire station such as rescue place and any fire incident as accident place by adding information of parent nodes to the A* algorithm to reduce searching time. It has two parts for generating efficient evacuation route. The first is producing the shortest route for fire engines to go to emergency places. Improving the A* algorithm in this paper speeds up the computation time of the route. Comparison results show that the proposed algorithm has a faster average response time than other algorithms. The second is that handling unexpected congestion on the identified shortest route by two ways not to delay emergency response condition. The simulation experiments were executed by the proposed method. The result of this system helps to find the most likely routes to get to the emergency area quickly.