An enhanced routing method with Dijkstra algorithm and AHP analysis in GIS-based emergency plan

Practical emergency routing plays an important role in emergency response for fire forces. This paper present an enhanced static emergency routing method, combining Dijkstra algorithm and analytical hierarchy process (or AHP) for the emergency planning. Firstly, time length weighted model was build up based on minimum time-consumption criteria, with the consideration of seven important impedance factors that influenced the fire forces´ routing. Then AHP was employed to calculate weights of the impedance factors for the model parameters. And then using Dijkstra algorithm to solve the weighted time length model, a new improved routing has then been achieved. Finally the some city´s GIS-based emergency routing map was taken as an example, experiments were carried out using the established model to produce the emergency routing for the fire forces. Comparisons between the original Dijkstra algorithm´s results and the improved mode´s results for the emergency routing has been made, and with the real fire forces´ routing experience acquired from age long experiences, improved model´s result shows the consistence with real situation. This research meets the urgent need of fire forces, and can be of great help to the emergency planning for the fire forces.