Multi-type maximal covering location problems: hybridizing discrete and continuous problems
From MaRDI portal
Publication:6167323
DOI10.1016/J.EJOR.2022.10.037arXiv2111.14494OpenAlexW3217393143MaRDI QIDQ6167323FDOQ6167323
Authors: Víctor Blanco, Ricardo Gázquez, Francisco Saldanha-da-Gama 
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Abstract: 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. The study proceeds considering the particular case in which the continuous facilities are to be located in the Euclidean plane. In this case, taking advantage from some geometrical properties it is possible to propose an alternative integer linear programming model. The results of an extensive battery of computational experiments performed to assess the methodological contribution of this work is reported on. The data consists of up to 920 demand nodes using real geographical and demographic data.
Full work available at URL: https://arxiv.org/abs/2111.14494
locationinteger programmingmaximal covering locationmultiple facility typesdiscrete-continuous hybridization
Cites Work
- Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
- Title not available (Why is that?)
- The Location of Emergency Service Facilities
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- The Hierarchical Service Location Problem
- A mean-shift algorithm for large-scale planar maximal covering location problems
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- On covering location problems on networks with edge demand
- Minmax regret maximal covering location problems with edge demands
- The variable radius covering problem
- Dual-based heuristics for a hierarchical covering location problem
- On the fuzzy maximal covering location problem
- New exact algorithms for planar maximum covering location by ellipses problems
- Optimal sensor deployment to increase the security of the maximal breach path in border surveillance
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Location covering models. History, applications and advancements
- Covering problems with polyellipsoids: a location analysis perspective
- Continuous maximal covering location problems with interconnected facilities
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
Cited In (5)
This page was built for publication: Multi-type maximal covering location problems: hybridizing discrete and continuous problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167323)
