Multi-type maximal covering location problems: hybridizing discrete and continuous problems
From MaRDI portal
(Redirected from Publication:6167323)
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.
Cites work
- A mean-shift algorithm for large-scale planar maximal covering location problems
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Continuous maximal covering location problems with interconnected facilities
- Covering problems with polyellipsoids: a location analysis perspective
- Dual-based heuristics for a hierarchical covering location problem
- scientific article; zbMATH DE number 3214278 (Why is no real title available?)
- Location covering models. History, applications and advancements
- Minmax regret maximal covering location problems with edge demands
- New exact algorithms for planar maximum covering location by ellipses problems
- On covering location problems on networks with edge demand
- On the fuzzy maximal covering location problem
- Optimal sensor deployment to increase the security of the maximal breach path in border surveillance
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
- The Hierarchical Service Location Problem
- The Location of Emergency Service Facilities
- The variable radius covering problem
Cited in
(7)- A separation based optimization approach to dynamic maximal covering location problems with switched structure
- The multimode covering location problem
- scientific article; zbMATH DE number 758441 (Why is no real title available?)
- Fairness in maximal covering location problems
- Facility location decisions for drone delivery: a literature review
- Edge downgrades in the maximal covering location problem
- Unmanned aerial vehicle variable radius set covering problem for emergency wireless network
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)
