Usage of Uniform Deployment for Heuristic Design of Emergency System

In this contribution, we deal with an emergency service system design, in which the average disutility is minimized. Optimization of the average user disutility is related to the large weighted p-median problem. The necessity to solve large instances of the problem has led to the development of many heuristic and approximate approaches. Due to complexity of the integer programming problems, the exact methods are often abandoned for their unpredictable computational time in the case, when a large instance of a location problem has to be solved. For practical use, various kinds of metaheuristics and heuristics are used to obtain a good solution. We focus on usage of uniform deployment of p-median solutions in heuristic tools for emergency service system design. We make use of the fact that the uniformly deployed set of solutions represents a partial mapping of the “terrain” and enables to determine areas of great interest. We study here the synergy of the uniformly deployed set and heuristics based on neighborhood search, where the solution neighborhood is set of all p-median solutions, Hamming distance of which from the current solution is 2.