Journal Article10.1287/IJOC.2016.0722
Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
Manish Bansal,Kiavash Kianfar +1 more
TL;DR: It is proved that PMCLP-PCR is NP-hard if the number of SZs is part of the input, and an improved algorithm is presented, which is at least two times faster than the existing exact plateau vertex traversal algorithm.
read more
Abstract: We study the planar maximum coverage location problem (MCLP) with rectilinear distance and rectangular demand zones in the case where “partial coverage” is allowed in its true sense, i.e., when covering part of a demand zone is allowed and the coverage accrued as a result of this is proportional to the demand of the covered part only. We pose the problem in a slightly more general form by allowing service zones to be rectangular instead of squares, thereby addressing applications in camera view-frame selection as well. More specifically, our problem, referred to as PMCLP-PCR (planar MCLP with partial coverage and rectangular demand and service zones), is to position a given number of rectangular service zones (SZs) on the two-dimensional plane to (partially) cover a set of existing (possibly overlapping) rectangular demand zones (DZs) such that the total covered demand is maximized. Previous studies on (planar) MCLP have assumed binary coverage, even when nonpoint objects such as lines or polygons have be...
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Allocation of emergency response centres in response to pluvial flooding-prone demand points using integrated multiple layer perceptron and maximum coverage location problem models
TL;DR: An optimised PF probability model with ideal location allocation methods on a geographic information system platform is combined to construct the proposed model for achieving accurate ERC spatial planning, and shows that areas near downtown have high PF probability but are not covered by ERCs within the standard 5 km radius.
51
Coverage area maximization with parallel simulated annealing
TL;DR: In this paper , the authors proposed a system that determines where to locate k disks-like services of radius r so that they globally cover as much as possible a region of demand. But the problem is NP-hard.
Disaster Mitigation in Urban Pakistan Using Agent Based Modeling with GIS
TL;DR: This study aims to propose an application of agent based modeling (ABM) and simulation for disaster mitigation in an urban region of Pakistan using geographical information system (GIS) maps for disaster management in the urban locality of Pakistan.
9
Orientational variable-length strip covering problem: A branch-and-price-based algorithm
Xiaoxuan Hu,Xiaoxuan Hu,Waiming Zhu,Waiming Zhu,Huawei Ma,Huawei Ma,Bo An,Yanling Zhi,Wu Yi,Wu Yi +9 more
TL;DR: A provable dominance rule is proposed to greatly reduce the solution space of the subproblem, enabling the application of an implicit enumeration (IE) algorithm and an efficient branch-and-price-based algorithm (BPBA) is developed.
8
Optimizing Police Facility Locations Based on Cluster Analysis and the Maximal Covering Location Problem
Bruno Ferreira da Costa Borba,Ana Paula Henriques de Gusmão,Thárcylla Rebecca Negreiros Clemente,T. C. C. Nepomuceno +3 more
TL;DR: The proposed management information system allows the analysis of alternative locations and their impacts on public security and provides an efficient tool for supporting decisions regarding the location of police facilities and helps improve the public security service.
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
An Automatic Method for Solving Discrete Programming Problems
Ailsa H. Land,Alison G. Doig +1 more
TL;DR: In the late 1950s there was a group of teachers and research assistants at the London School of Economics interested in linear programming and its extensions, in particular Helen Makower, George Morton, Ailsa Land and Alison Doig.
The maximal covering location problem
Richard L. Church,Charles R. Velle +1 more
- 01 Jan 1974
TL;DR: The use of a maximal service distance as a measure of the value of a given locational configuration has been discussed at length by Toregas and ReVelle 1 who show that it is an important surrogate measurement for the value.
2.3K
Related Papers (5)
Richard L. Church,Charles R. Velle +1 more
- 01 Jan 1974
Andrew Cherry,Joachim Gudmundsson,Julián Mestre,Julián Mestre +3 more
- 04 Sep 2017