Anti-covering Problems

  • Emilio Carrizosa
  • Boglárka G.-TóthEmail author


In covering location models, one seeks the location of facilities optimizing the weight of individuals covered, i.e., those at the distance from the facilities below a threshold value. Attractive facilities are wished to be close to the individuals, and thus the covering is to be maximized, while for repulsive facilities the covering is to be minimized. On top of such individual-facility interactions, facility-facility interactions are relevant, since they may repel each other. This chapter is focused on models for locating facilities using covering criteria, taking into account that facilities are repulsive from each other. Contrary to the usual approach, in which individuals are assumed to be concentrated at a finite set of points, we assume the individuals to be continuously distributed in a planar region. The problem is formulated as a global optimization problem, and a branch and bound algorithm is proposed.


Covering problems Repulsive facilities Regional demand Global optimization Big square small square 



Research partially supported by research grants and projects ICT COST Action TD1207 (EU), the Hungarian National Research, Development and Innovation Office—NKFIH (OTKA grant PD115554), MTM2012-36163 (Ministerio de Ciencia e Innovación, Spain), P11-FQM-7603, FQM329 (Junta de Andalucía, Spain), all with EU ERDF funds.


  1. Alonso I, Carrizosa E, Conde E (1998) Maximin location: discretization not always works. Top 6:313–319CrossRefMathSciNetzbMATHGoogle Scholar
  2. Avella P, Boccia M (2007) A cutting plane algorithm for the capacitated facility location problem. Comput Optim Appl 43:39–65CrossRefMathSciNetzbMATHGoogle Scholar
  3. Avella P, Sassano A, Vasil’ev I (2006) Computational study of large-scale p-median problems. Math Program 109:89–114CrossRefMathSciNetzbMATHGoogle Scholar
  4. Berman O, Huang R (2008) The minimum weighted covering location problem with distance constraints. Comput Oper Res 35:356–372CrossRefMathSciNetzbMATHGoogle Scholar
  5. Berman O, Krass D (2002) The generalized maximal covering location problem. Comput Oper Res 29:563–581CrossRefMathSciNetzbMATHGoogle Scholar
  6. Berman O, Wang J (2011) The minmax regret gradual covering location problem on a network with incomplete information of demand weights. Eur J Oper Res 208:233–238CrossRefMathSciNetzbMATHGoogle Scholar
  7. Berman O, Drezner Z, Wesolowsky GO (1996) Minimum covering criterion for obnoxious facility location on a network. Networks 28:1–5CrossRefMathSciNetzbMATHGoogle Scholar
  8. Berman O, Krass D, Drezner Z (2003) The gradual covering decay location problem on a network. Eur J Oper Res 151:474–480CrossRefMathSciNetzbMATHGoogle Scholar
  9. Berman O, Drezner Z, Krass D (2009a) Cooperative cover location problems: the planar case. IIE Trans 42:232–246CrossRefGoogle Scholar
  10. Berman O, Drezner Z, Wesolowsky GO (2009b) The maximal covering problem with some negative weights. Geogr Anal 41:30–42CrossRefGoogle Scholar
  11. Berman O, Kalcsics J, Krass D, Nickel S (2009c) The ordered gradual covering location problem on a network. Discret Appl Math 157:3689–3707CrossRefMathSciNetzbMATHGoogle Scholar
  12. Berman O, Drezner Z, Krass D (2010) Generalized coverage: new developments in covering location models. Comput Oper Res 37:1675–1687CrossRefMathSciNetzbMATHGoogle Scholar
  13. Blanquero R, Carrizosa E (2002) A DC biobjective location model. J Glob Optim 23:139–154CrossRefzbMATHGoogle Scholar
  14. Blanquero R, Carrizosa E (2008) Continuous location problems and big triangle small triangle: constructing better bounds. J Glob Optim 45:389–402CrossRefMathSciNetzbMATHGoogle Scholar
  15. Blanquero R, Carrizosa E (2013) Solving the median problem with continuous demand on a network. Comput Optim Appl 56:723–734CrossRefMathSciNetzbMATHGoogle Scholar
  16. Bowman A, Foster P (1993) Density based exploration of bivariate data. Stat Comput 3:171–177CrossRefGoogle Scholar
  17. Brimberg J, Juel H, Körner MC, Shöbel A (2015) On models for continuous facility location with partial coverage. J Oper Res Soc 66:33–43CrossRefGoogle Scholar
  18. Carrizosa E, Plastria F (1998) Locating an undesirable facility by generalized cutting planes. Math Oper Res 23:680–694CrossRefMathSciNetzbMATHGoogle Scholar
  19. Carrizosa E, Plastria F (1999) Location of semi-obnoxious facilities. Stud Locat Anal 12:1–27MathSciNetzbMATHGoogle Scholar
  20. Carrizosa E, Conde E, Muñoz-Márquez M, Puerto J (1995) The generalized Weber problem with expected distances. RAIRO- Oper Res 29:35–57CrossRefMathSciNetzbMATHGoogle Scholar
  21. Carrizosa E, Muñoz-Márquez M, Puerto J (1998a) Location and shape of a rectangular facility in \(\Re ^n\). Convexity properties. Math Program 83:277–290MathSciNetzbMATHGoogle Scholar
  22. Carrizosa E, Muñoz-Márquez M, Puerto J (1998b) A note on the optimal positioning of service units. Oper Res 46:155–156CrossRefMathSciNetzbMATHGoogle Scholar
  23. Carrizosa E, Muñoz-Márquez M, Puerto J (1998c) The Weber problem with regional demand. Eur J Oper Res 104:358–365CrossRefzbMATHGoogle Scholar
  24. Chaudhry SS (2006) A genetic algorithm approach to solving the anti-covering location problem. Expert Syst 23:251–257CrossRefGoogle Scholar
  25. Christaller W (1966) Central places in Southern Germany. Prentice-Hall, LondonGoogle Scholar
  26. Church R, ReVelle C (1974) The maximal covering location problem. Pap Reg Sci 32:101–118CrossRefGoogle Scholar
  27. Colebrook M, Sicilia J (2013) Hazardous facility location models on networks. In: Batta R, Kwon C (eds) Handbook of OR/MS models in Hazardous materials transportation. Springer, New York, pp 155–186CrossRefGoogle Scholar
  28. Colmenar JM, Martí R, Duarte A (2018) Heuristics for the bi-objective diversity problem. Expert Sys Appl 108:193–205CrossRefGoogle Scholar
  29. Current JR, Schilling DA (1990) Analysis of errors due to demand data aggregation in the set covering and maximal covering location problems. Geogr Anal 22:116–126CrossRefGoogle Scholar
  30. Curtin KM, Church RL (2006) A family of location models for multiple-type discrete dispersion. Geogr Anal 38:248–270CrossRefGoogle Scholar
  31. Daskin MS, Haghani AE, Khanal M, Malandraki C (1989) Aggregation effects in maximum covering models. Ann Oper Res 18:113–139CrossRefMathSciNetzbMATHGoogle Scholar
  32. Drezner Z (2012) Solving planar location problems by global optimization. Logist Res 6:17–23CrossRefGoogle Scholar
  33. Drezner Z, Suzuki A (2004) The big triangle small triangle method for the solution of nonconvex facility location problems. Oper Res 52:128–135CrossRefzbMATHGoogle Scholar
  34. Drezner Z, Wesolowsky G (1994) Finding the circle or rectangle containing the minimum weight of points. Locat Sci 2:83–90zbMATHGoogle Scholar
  35. Drezner Z, Wesolowsky GO, Drezner T (2004) The gradual covering problem. Nav Res Logist 51:841–855CrossRefMathSciNetzbMATHGoogle Scholar
  36. Drezner Z, Kalczynski P, Salhi S (2019) The planar multiple obnoxious facilities location problem: a Voronoi based heuristic. Omega 87:105–116. Scholar
  37. Erkut E, Neuman S (1989) Analytical models for locating undesirable facilities. Eur J Oper Res 40:275–291CrossRefMathSciNetzbMATHGoogle Scholar
  38. Erkut E, Neuman S (1991) Comparison of four models for dispersing facilities. Inf Syst Oper Res 29:68–86zbMATHGoogle Scholar
  39. Farhan B, Murray AT (2006) Distance decay and coverage in facility location planning. Ann Reg Sci 40:279–295CrossRefGoogle Scholar
  40. Fekete SP, Mitchell JSB, Beurer K (2005) On the continuous Fermat-Weber problem. Oper Res 53:61–76CrossRefMathSciNetzbMATHGoogle Scholar
  41. Fernández J, Fernández P, Pelegrín B (2000) A continuous location model for siting a non-noxious undesirable facility within a geographical region. Eur J Oper Res 121:259–274CrossRefzbMATHGoogle Scholar
  42. Fliege J (2001) OLAF—a general modeling system to evaluate and optimize the location of an air polluting facility. OR Spectr 23:117–136CrossRefzbMATHGoogle Scholar
  43. Francis RL, Lowe TJ (2011) Comparative error bound theory for three location models: continuous demand versus discrete demand. Top 22:144–169CrossRefMathSciNetzbMATHGoogle Scholar
  44. Francis RL, Lowe TJ, Tamir A (2000) Aggregation error bounds for a class of location models. Oper Res 48:294–307CrossRefMathSciNetzbMATHGoogle Scholar
  45. Francis RL, Lowe TJ, Tamir A (2002) Demand point aggregation for location models. In: Drezner Z, Hamacher HW (eds) Facility location. Springer, Berlin, pp 207–232CrossRefzbMATHGoogle Scholar
  46. Francis RL, Lowe TJ, Rayco MB, Tamir A (2008) Aggregation error for location models: survey and analysis. Ann Oper Res 167:171–208CrossRefMathSciNetzbMATHGoogle Scholar
  47. Hansen P, Peeters D, Richard D, Thisse JF (1985) The minisum and minimax location problems revisited. Oper Res 33:1251–1265CrossRefMathSciNetzbMATHGoogle Scholar
  48. Hwang M, Chiang C, Liu Y (2004) Solving a fuzzy set-covering problem. Math Comput Model 40:861–865CrossRefMathSciNetzbMATHGoogle Scholar
  49. Karasakal O, Karasakal EK (2004) A maximal covering location model in the presence of partial coverage. Comput Oper Res 31:1515–1526CrossRefMathSciNetzbMATHGoogle Scholar
  50. Karkazis J, Papadimitriou C (1992) A branch-and-bound algorithm for the location of facilities causing atmospheric pollution. Eur J Oper Res 58:363–373CrossRefzbMATHGoogle Scholar
  51. Kim K, Murray AT (2008) Enhancing spatial representation in primary and secondary coverage location modeling. J Reg Sci 48:745–768CrossRefGoogle Scholar
  52. Kolen A, Tamir A (1990) Covering problems. In: Mirchandani P, Francis R (eds) Discrete location theory. Wiley, New YorkGoogle Scholar
  53. Kuby MJ (1987) Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems. Geogr Anal 19:315–329CrossRefGoogle Scholar
  54. Lei TL, Church RL (2013) A unified model for dispersing facilities. Geogr Anal 45:401–418CrossRefGoogle Scholar
  55. Li X, Zhao Z, Zhu X, Wyatt T (2011) Covering models and optimization techniques for emergency response facility location and planning: a review. Math Meth Oper Res 74:281–310CrossRefMathSciNetzbMATHGoogle Scholar
  56. Mladenović N, Plastria F, Urošević (2005) Reformulation descent applied to circle packing problems. Comput Oper Res 32:2419–2434Google Scholar
  57. Moon ID, Chaudhry SS (1984) An analysis of network location problems with distance constraints. Manag Sci 30:290–307CrossRefzbMATHGoogle Scholar
  58. Murat A, Verter V, Laporte G (2010) A continuous analysis framework for the solution of location—allocation problems with dense demand. Comput Oper Res 37:123–136CrossRefMathSciNetzbMATHGoogle Scholar
  59. Murray AT (2005) Geography in coverage modeling: exploiting spatial structure to address complementary partial service of areas. Ann Assoc Am Geogr 95:761–772CrossRefGoogle Scholar
  60. Murray AT, Church RL (1997) Solving the anti-covering location problem using Lagrangian relaxation. Comput Oper Res 24:127–140CrossRefzbMATHGoogle Scholar
  61. Murray AT, O’Kelly ME (2002) Assessing representation error in point-based coverage modeling. J Geogr Syst 4:171–191CrossRefGoogle Scholar
  62. Murray AT, Wei R (2013) A computational approach for eliminating error in the solution of the location set covering problem. Eur J Oper Res 224:52–64CrossRefMathSciNetzbMATHGoogle Scholar
  63. Murray AT, Tong D, Kim K (2009) Enhancing classic coverage location models. Int Reg Sci Rev 33:115–133CrossRefGoogle Scholar
  64. Niblett MR, Church RL (2015) The disruptive anti-covering location problem. Eur J Oper Res 247:764–773CrossRefMathSciNetzbMATHGoogle Scholar
  65. Plastria F (1992) Gbsss: the generalized big square small square method for planar single-facility location. Eur J Oper Res 62:163–174CrossRefzbMATHGoogle Scholar
  66. Plastria F (2001) On the choice of aggregation points for continuous p-median problems: a case for the gravity centre. Top 9:217–242CrossRefMathSciNetzbMATHGoogle Scholar
  67. Plastria F (2002) Continuous covering location problems. In: Drezner Z, Hamacher HW (eds) Facility location. Springer, Berlin, pp 39–83Google Scholar
  68. Plastria F, Carrizosa E (1999) Undesirable facility location with minimal covering objectives. Eur J Oper Res 119:158–180CrossRefzbMATHGoogle Scholar
  69. Plastria F, Gordillo J, Carrizosa E (2013) Locating a semi-obnoxious covering facility with repelling polygonal regions. Discret Appl Math 161:2604–2623CrossRefMathSciNetzbMATHGoogle Scholar
  70. Romero-Morales D, Carrizosa E, Conde E (1997) Semi-obnoxious location models: a global optimization approach. Eur J Oper Res 102:295–301CrossRefzbMATHGoogle Scholar
  71. Saboonchi B, Hansen P, Perron S (2014) MaxMinMin p-dispersion problem: a variable neighborhood search approach. Comput Oper Res 52:251–259CrossRefMathSciNetzbMATHGoogle Scholar
  72. Sayyady F, Fathi Y (2016) An integer programming approach for solving the p-dispersion problem. Eur J Oper Res 253:216–225CrossRefMathSciNetzbMATHGoogle Scholar
  73. Sayyady F, Tutunchi GK, Fathi Y (2015) p-Median and p-dispersion problems: a bi-criteria analysis. Comput Oper Res 61:46–55CrossRefMathSciNetzbMATHGoogle Scholar
  74. Schilling VJ DA, Barkhi R (1993) A review of covering problems in facility location. Locat Sci 1:25–55zbMATHGoogle Scholar
  75. Schöbel A, Scholz D (2010) The big cube small cube solution method for multidimensional facility location problems. Comput Oper Res 37:115–122CrossRefMathSciNetzbMATHGoogle Scholar
  76. Tong D (2012) Regional coverage maximization: a new model to account implicitly for complementary coverage. Geogr Anal 44:1–14CrossRefGoogle Scholar
  77. Tong D, Church RL (2012) Aggregation in continuous space coverage modeling. Int J Geogr Inf Sci 26:795–816CrossRefGoogle Scholar
  78. Tong D, Murray AT (2009) Maximising coverage of spatial demand for service. Pap Reg Sci 88:85–97CrossRefGoogle Scholar
  79. Tutunchi GK, Fathi Y (2019) Effective methods for solving the Bi-criteria p-Center and p-Dispersion problem. Comput Oper Res 101:43–54CrossRefMathSciNetzbMATHGoogle Scholar
  80. Wand MP, Jones MC (1993) Comparison of smoothing parameterizations in bivariate kernel density estimation. J Am Stat Assoc 88:520–528CrossRefMathSciNetzbMATHGoogle Scholar
  81. Wand MP, Jones MC (1995) Kernel smoothing. Springer, BerlinCrossRefzbMATHGoogle Scholar
  82. Wei, R, Murray, AT (2014) A multi-objective evolutionary algorithm for facility dispersion under conditions of spatial uncertainty. J Oper Res Soc 65:1133–1142CrossRefGoogle Scholar
  83. Wei, R, Murray, AT (2017). Spatial uncertainty challenges in location modeling with dispersion requirements. In: Thill JC (ed) Spatial analysis and location modeling in Urban and regional systems. Springer, Berlin, pp 283–300Google Scholar
  84. Yao J, Murray AT (2014) Serving regional demand in facility location. Pap Reg Sci 93:643–662CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Instituto de Matemáticas de la Universidad de SevillaUniversidad de SevillaSevillaSpain
  2. 2.Department of Computational Optimization, Institute of InformaticsUniversity of SzegedSzegedHungary

Personalised recommendations