Evaluation and optimization of urban fire station configuration based on min-plus algebra accessibility

Urban fire station configuration is a key issue in urban fire protection planning. The time from the exit of the city fire station to the fire jurisdiction is an important factor affecting fire rescue. In the event of a fire, in order to enable the fire brigade to reach the fire point within "3 min", this paper proposes a method for evaluating and optimizing the fire station configuration based on the min-plus algebra domain. This method first abstracts the fire protection network into a network topology graph, calculates the optimal path of the network through the improved Dijkstra algorithm, and evaluates the "3 min" reachability of the fire protection network. Then it adds the miniature fire station to optimize the fire station configuration, and transforms the fire station addition problem into a 0-1 shaping planning problem. Finally, we obtain the optimal solution under the "3 min" reachable condition. The experimental results show that the optimized fire station configuration improves the accessibility of the fire station to the demand point, increases the rationality of the urban fire station configuration in time, and has certain application value and decision-making significance for urban fire protection planning.