Multiple Table Models Based on Queuing Theory for Firefighting Traffic Problems

Abstract

Abstract With the development of global urbanization, urban planning has been a hot spot of most concern. Since the traditional urban fire station setting method has been gradually unable to meet the emergency needs of a city. In this paper, a series of methods are developed to achieve the best balance between economic expenditure and reliability. According to the heat maps about emergency calls in a city in recent years, different types of alarm phones have obvious regional distribution characteristics. Inspired by the Queuing Theory algorithm, we abstract this complex problem into a parallel multi-server waiting queuing model to find each average queue length of three kinds of alarm calls and success in converting the multiplicity problem into solving the vehicle number and location problems respectively. Based on this planning problem, new combinations with different numbers of vehicles can be gotten. Then based on the assignment model, the optimal deployment plan can also be different with different numbers and geographical locations of the three kinds of stations. Our method significantly improves the firefighting traffic problems and can be applied in the actual situation.