Median and covering location problems with interconnected facilities (2019). Computers and Operations Research, 107, 1-18.

[:es]Marilène Cherkesly (Université du Québec à Montréal), Mercedes Landete (Miguel Hernández University of Elche) and Gilbert Laporte (HEC Montréal).
Abstract. This paper introduces two classes of location problems with interconnected facilities. These problems dif- fer from classical location problems in the sense that the facilities to be located must be interconnected, i.e. located within a prescribed distance of a central office or of each other. Such problems arise, for example, in contexts where forest fire-fighters must be able to reach each other by short-range radios, or when locating interconnected sensors. Median and covering problems are modeled through several formulations. A metaheuristic consisting of a hybrid construction phase followed by an iterative search process developed for the median and covering problems. Extensive tests are performed in order to assess the performance of the proposed methodology.
Keywords. Facility location; Interconnectivity; Median problem; Covering; Metaheuristic[:]