Skip to Main Content
Determining the appropriate locations for inspection stations in a traffic network is a special kind of flow interception problem. It has very important applications in the fields of traffic management and police defense management. It is of great significance to research this problem. Based on the analysis of the characteristics of traffic flow, and on the assumption that the interarrival times of the cars follow Poisson distribution and the service time follows negative exponential distribution, this paper intends to research that with the case of the constraints of the expected car queue length, the expected car waiting time, the server busy rate and inspection station capacity taken into account, and based on queueing theory, a non-linear integer programming model for the problem of inspection station location is formulated. Finally, a numerical example is given.