R. Gázquez, V. Blanco, F. Saldanha-da-Gama
This paper introduces a general modeling framework for a multi-type maximal covering location problem in which the position of facilities in different metric spaces are simultaneously decided to maximize the demand generated by a set of points. From the need of intertwining location decisions in discrete and in continuous sets, a general hybridized problem is considered in which some types of facilities are to be located in finite sets and the others in continuous metric spaces. A natural non-linear model is proposed for which an integer linear programming reformulation is derived. A branch-and-cut algorithm is developed for better tackling the problem. If the the continuous facilities are to be located in the Euclidean plane, taking advantage from some geometrical properties it is possible to propose an alternative integer linear programming model. The results of a battery of computational experiments performed to assess the methodological contribution of this work is reported on.
Palabras clave: Location, Integer programming, Maximal covering location, Multiple facility types, Discrete-continuous hybridization
Programado
GT01 Localización V. Localización Continua
8 de junio de 2022 17:20
A15
