MULTI-COVERAGE DYNAMIC MAXIMAL COVERING LOCATION PROBLEM

Abstract

In the field of service management plays a decisive role the location of the facilities to improve the quality of services. The maximal covering location problem allows locating a known number of facilities in order to maximize the demand covered. An important aspect to take into account is the varying of demand of the nodes with respect to the time (multi-period model). In addition, each facility could be of different types. A model that takes into account the existence of different types of facilities in order to cover the demand in multi-period environments has not been found in the literature. In this paper we propose a new generalization of the dynamic maximal covering location problem where different types of facilities (with different radius of coverage) could be open in each location. In this work we used the model on case study with the objective to locate the police patrol.