d-Cover algorithm for location in urban emergency systems

This paper approached a cover algorithm for location problem in the optimization of emergency system. With the considering of requirements, emergency response time and total system cost, a distribution of the dispatch points can be obtained by the algorithm. The demands region/points can be covered by the circles with radius d and everyone takes a dispatch point as center. Contributes to the well property of Gaussian convolution, the local demands level can be obtained and the distribution based on covers and sorted demands is more efficient. Numerical examples show that the proposed algorithm can solve the location problem in the optimization of emergency systems.