Study On The Optimal Rescue Route Of Firefighting Power Coverage Area In Fuxin

In order to achieve rapid,accurate and effective control of fire,rescue personnel and eliminate the influence of the fire consequences,mainly study on the optimal rescue routes of firefighting power coverage area in Fuxin,to realise the shortest time from the fire station to the fire scene and grasp the fire fighting and rescue time.This thesis study on the optimal rescue route from the following three aspects:First,on the shortest path,this thesis uses MATLAB to program the Dijkstra shortest path algorithm to realize the shortest path of fire rescue,before programming,the shortcomings of classical Dijkstra algorithm is improved,which improves the efficiency and shortens the running time.Second,on the travel time,in this thesis,the outside various uncertain factors are considered,such as weather,road and traffic,etc.Time correction coefficient(K value)is introduced,the road actual length is converted to the calculation length and the average speed of the vehicle is used to solve the travel time.Finally,on the optimal rescue route choice problem,the optimal rescue route is selected by the length of the travel time of the fire vehicle.In this thesis,the road visualization and the location information are obtained by GIS and Earth-map technology and drawn road network topology.Assuming the Shengjie bath as the scene of the fire,and taking Fuxin Haizhou Fire Squadron Responsibility Area as an example to carry out the optimal route study.Finally,the thesis study and analyze the selection of the optimal rescue route of emergency operation of adjacent fire stations.