Studies On Optimal Path Algorithms In Fire Fighting And Rescue

The city fire protection is an important problem that relates to the society stability and public safety. With the city development in China, the fire situation goes into a more rigorous period. The traditional method can't satisfy the demand of the modern fire protection. It is needed to build a practical city fire protection geography information system, provide the project of the fire fighting force dispatch quickly and provide assistance decision quickly. The limited manpower and material resources can be well used to reduce the loss to the least. And in this system, the optimal dispatch of the fire fighting force is a very important part.In this paper, the development condition of the geography information system (GIS) and the developing trend in the fire protection realm is introduced base on the fire situation in China. The development condition and classification system of the shortest path algorithm is analyzed. The circumstance of actual instance in fire protection is analyzed, and the optimal dispatch model in fire fighting and rescue is built. Base on this model, the classical shortestpath algorithm-Dijkstra algorithm is studied detailedly. The algorithm is optimized bybinary heap for the algorithm, by which the time complexity of Dijkstra algorithm is lowered and the efficiency is elevated. The traffic net is optimized by hierarchical spatial reasoning in the traffic network. It is shown that the optimized algorithm can satisfy the dispatch of the fire fighting force practicably in the actual application. Finally, the optimized algorithm is applied to the orbit of Xi'an NO.1 fire brigade. It is indicated that the algorithm matches the actual circumstance and is more practical by the results.