The multiple gradual cover location problem
Authors:
- 20 May 2018
- journal article
- research article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 70 (6) , 931-940
Abstract
Covering location models assume that a demand point is either fully covered or not covered at all. Gradual cover models consider the possibility of partial cover. In this paper, we investigate the issue of joint partial coverage by several facilities in a multiple facilities location model. We establish theoretical foundations for the properties of the joint coverage relationship to individual partial covers and develop models based on these theoretical foundations. The location problems are solved both heuristically and optimally within a pre-specified percentage from the optimal solution.Keywords
This publication has 22 references indexed in Scilit:
- Empirical Analysis of Ambulance Travel Times: The Case of Calgary Emergency Medical ServicesManagement Science, 2010
- Cooperative cover location problems: The planar caseIIE Transactions, 2009
- The variable radius covering problemEuropean Journal of Operational Research, 2009
- The Maximal Covering Problem with Some Negative WeightsGeographical Analysis, 2009
- Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networksComputer Networks, 2008
- Competitive facility location model with concave demandEuropean Journal of Operational Research, 2007
- The gradual covering decay location problem on a networkEuropean Journal of Operational Research, 2003
- An Efficient Genetic Algorithm for the p-Median ProblemAnnals of Operations Research, 2003
- The generalized maximal covering location problemComputers & Operations Research, 2002
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990