The multiple gradual cover location problem

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.

[1]  Tammy Drezner,et al.  Location of Casualty Collection Points , 2004 .

[2]  G. O. Wesolowsky,et al.  The gradual covering problem , 2004 .

[3]  Zvi Drezner,et al.  The Maximal Covering Problem with Some Negative Weights , 2009 .

[4]  Zvi Drezner,et al.  Equity Models in Planar Location , 2006, Comput. Manag. Sci..

[5]  Zvi Drezner,et al.  The maximin gradual cover location problem , 2014, OR Spectr..

[6]  Kenneth L. Roberts,et al.  Generalized coverage models and public facility location , 1983 .

[7]  Oded Berman,et al.  The generalized maximal covering location problem , 2002, Comput. Oper. Res..

[8]  Zvi Drezner,et al.  Cooperative cover location problems: The planar case , 2009 .

[9]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[10]  IngolfssonArmann,et al.  Empirical Analysis of Ambulance Travel Times , 2010 .

[11]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[12]  I. K. Altinel,et al.  Optimal sensor deployment to increase the security of the maximal breach path in border surveillance , 2017, Eur. J. Oper. Res..

[13]  Zvi Drezner,et al.  An Efficient Genetic Algorithm for the p-Median Problem , 2003, Ann. Oper. Res..

[14]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[15]  Armann Ingolfsson,et al.  Empirical Analysis of Ambulance Travel Times: The Case of Calgary Emergency Medical Services , 2010, Manag. Sci..

[16]  Zvi Drezner,et al.  The variable radius covering problem , 2009, Eur. J. Oper. Res..

[17]  H. A. Eiselt,et al.  Gradual location set covering with service quality , 2009 .

[18]  Zvi Drezner,et al.  A stochastic gradual cover location problem , 2010 .

[19]  Esra Köktener Karasakal,et al.  A maximal covering location model in the presence of partial coverage , 2004, Comput. Oper. Res..

[20]  I. K. Altinel,et al.  Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks , 2008, Comput. Networks.

[21]  Oded Berman,et al.  Competitive facility location model with concave demand , 2007, Eur. J. Oper. Res..

[22]  T. Klastorin.  On a discrete nonlinear and nonseparable knapsack problem , 1990 .

[23]  Zvi Drezner,et al.  The gradual covering decay location problem on a network , 2003, Eur. J. Oper. Res..