Optimal Route Finding to Support Fire Emergency Service

Abstract

Urban fire is one of the most ordinary problems in all nations. Fire can cause serious damages to people and properties. When the fire event occurred, it is extremely important to reach the fire vehicles to incident site as fast as possible. To reach to the incident site in short time and fast, we need to exactly identify the incident location and need to determine the suitable route. But there are some difficulties to identify the incident location and to choose optimal route. Because the road network infrastructure of Myanmar is still weak in structure. In some townships, there are narrowed roads which could not clearly see from Google Earth and not wide enough to enter the fire vehicles and closed roads which are not passed through the other streets. These roads can cause problems for drivers and delays during the emergency cases. Another difficulty is that Google Map can’t give the user desired location when we used the specific address. As mention in above, some fire vehicles can't reach the incident location in time. So, we develop GIS based optimal route finding system to support fire emergency services. This system is intended to identify the fire incident location in short time, to find the nearest fire station and calculate the optimal route to travel the incident site from fire station by avoiding the closed and narrowed roads. In this paper, the optimal route is calculated by using Dijkstra’s Algorithm and we also considered the traffic condition in route finding.