Urban fire is one of the most disturbing problems 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. To tackle this problem, it is required to develop an effective response system on a regional scale. The objective of this paper is therefore to establish a system that can identify the best route from any fire incident to the nearest or closest rescue places such as urban fire emergency services, hospitals, police stations and so on. GIS-based technology is applied in this system for finding the best route by considering traffic data. Both graph theory and network analysis tools in GIS are applied for the purpose of modeling and analyzing transportation networks. A transportation network can be referred to as a valued graph consisting of a set of vertices and a set of edges. In order to compute length of the shortest path from the source to each of the remaining points in the graph, Dijkstra's algorithm can be used. Comparing to the normal shortest route, the algorithm in this system can provide an optimal route selection, which costs less time and has a higher average speed.