Resumen
Urban fire plays one of the most important problems that causes disturbing conditions not only for developing countries but also for developed countries. In spite of the modern techniques of fire prevention and suppression, urban fires continue to damage properties and lives. It is required to develop an effective response system on a regional scale to tackle this problem. Therefore, this system intends to establish a system that can identify the best route from any fire incident to the nearest or closest rescue places such as fire emergency services, hospitals, police stations and so on. In this system, GIS-based technology applies for finding the best route by considering traffic data. Both graph theory and network analysis tools in GIS are supplied for modeling and analyzing transportation networks. A transportation network is a valued graph that contains a set of vertices, and edges. To compute the length of the shortest path from the source to each of the remaining points in the graph, the system uses Dijkstra's algorithm. Comparing to other simple shortest route, the algorithm in this system can provide an optimal route that consumes less time but the average speed is higher.