Skip to main content
SpringerLink
Log in

Anti-covering Problems

  • Chapter
  • First Online:
Location Science

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Alonso I, Carrizosa E, Conde E (1998) Maximin location: discretization not always works. TOP 6:313–319

    Article  Google Scholar 

  • Avella P, Boccia M (2007) A cutting plane algorithm for the capacitated facility location problem. Comput Optim Appl 43:39–65

    Article  Google Scholar 

  • Avella P, Sassano A, Vasil’ev I (2006) Computational study of large-scale p-median problems. Math Program 109:89–114

    Article  Google Scholar 

  • Berman O, Huang R (2008) The minimum weighted covering location problem with distance constraints. Comput Oper Res 35:356–372

    Article  Google Scholar 

  • Berman O, Krass D (2002) The generalized maximal covering location problem. Comput Oper Res 29:563–581

    Article  Google Scholar 

  • 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–238

    Article  Google Scholar 

  • Berman O, Drezner Z, Wesolowsky GO (1996) Minimum covering criterion for obnoxious facility location on a network. Networks 28:1–5

    Article  Google Scholar 

  • Berman O, Krass D, Drezner Z (2003) The gradual covering decay location problem on a network. Eur J Oper Res 151:474–480

    Article  Google Scholar 

  • Berman O, Drezner Z, Krass D (2009a) Cooperative cover location problems: the planar case. IIE Trans 42:232–246

    Article  Google Scholar 

  • Berman O, Drezner Z, Wesolowsky GO (2009b) The maximal covering problem with some negative weights. Geogr Anal 41:30–42

    Article  Google Scholar 

  • Berman O, Kalcsics J, Krass D, Nickel S (2009c) The ordered gradual covering location problem on a network. Discrete Appl Math 157:3689–3707

    Article  Google Scholar 

  • Berman O, Drezner Z, Krass D (2010) Generalized coverage: new developments in covering location models. Comput Oper Res 37:1675–1687

    Article  Google Scholar 

  • Blanquero R, Carrizosa E (2002) A DC biobjective location model. J Global Optim 23:139–154

    Article  Google Scholar 

  • Blanquero R, Carrizosa E (2008) Continuous location problems and big triangle small triangle: constructing better bounds. J Global Optim 45:389–402

    Article  Google Scholar 

  • Blanquero R, Carrizosa E (2013) Solving the median problem with continuous demand on a network. Comput Optim Appl 56:723–734

    Article  Google Scholar 

  • Bowman A, Foster P (1993) Density based exploration of bivariate data. Stat Comput 3:171–177

    Article  Google Scholar 

  • Carrizosa E, Plastria F (1998) Locating an undesirable facility by generalized cutting planes. Math Oper Res 23:680–694

    Article  Google Scholar 

  • Carrizosa E, Plastria F (1999) Location of semi-obnoxious facilities. Stud Locat Anal 12:1–27

    Google Scholar 

  • Carrizosa E, Conde E, Muñoz-Márquez M, Puerto J (1995) The generalized Weber problem with expected distances. RAIRO-Rech Oper 29:35–57

    Google Scholar 

  • Carrizosa E, Muñoz-Márquez M, Puerto J (1998a) Location and shape of a rectangular facility in \(\mathfrak{R}^{n}\) convexity properties. Math Program 83:277–290

    Google Scholar 

  • Carrizosa E, Muñoz-Márquez M, Puerto J (1998b) A note on the optimal positioning of service units. Oper Res 46:155–156

    Article  Google Scholar 

  • Carrizosa E, Muñoz-Márquez M, Puerto J (1998c) The Weber problem with regional demand. Eur J Oper Res 104:358–365

    Article  Google Scholar 

  • Chaudhry SS (2006) A genetic algorithm approach to solving the anti-covering location problem. Expert Syst 23:251–257

    Article  Google Scholar 

  • Christaller W (1966) Central places in southern Germany. Prentice-Hall, London

    Google Scholar 

  • Church R, ReVelle C (1974) The maximal covering location problem. Pap Reg Sci Assoc 32:101–118

    Article  Google Scholar 

  • 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–126

    Article  Google Scholar 

  • Curtin KM, Church RL (2006) A family of location models for multiple-type discrete dispersion. Geogr Anal 38:248–270

    Article  Google Scholar 

  • Daskin MS, Haghani AE, Khanal M, Malandraki C (1989) Aggregation effects in maximum covering models. Ann Oper Res 18:113–139

    Article  Google Scholar 

  • Drezner Z (2012) Solving planar location problems by global optimization. Logist Res 6:17–23

    Article  Google Scholar 

  • Drezner Z, Suzuki A (2004) The big triangle small triangle method for the solution of nonconvex facility location problems. Oper Res 52:128–135

    Article  Google Scholar 

  • Drezner Z, Wesolowsky G (1994) Finding the circle or rectangle containing the minimum weight of points. Locat Sci 2:83–90

    Google Scholar 

  • Drezner Z, Wesolowsky GO, Drezner T (2004) The gradual covering problem. Nav Res Log 51:841–855

    Article  Google Scholar 

  • Erkut E, Neuman S (1989) Analytical models for locating undesirable facilities. Eur J Oper Res 40:275–291

    Article  Google Scholar 

  • Erkut E, Neuman S (1991) Comparison of four models for dispersing facilities. INFOR 29:68–86

    Google Scholar 

  • Farhan B, Murray AT (2006) Distance decay and coverage in facility location planning. Ann Reg Sci 40:279–295

    Article  Google Scholar 

  • Fekete SP, Mitchell JSB, Beurer K (2005) On the continuous fermat-weber problem. Oper Res 53:61–76

    Article  Google Scholar 

  • 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–274

    Article  Google Scholar 

  • Fliege J (2001) OLAF—a general modeling system to evaluate and optimize the location of an air polluting facility. OR Spectr 23:117–136

    Article  Google Scholar 

  • Francis RL, Lowe TJ (2011) Comparative error bound theory for three location models: continuous demand versus discrete demand. TOP 22:144–169

    Article  Google Scholar 

  • Francis RL, Lowe TJ, Tamir A (2000) Aggregation error bounds for a class of location models. Oper Res 48:294–307

    Article  Google Scholar 

  • Francis RL, Lowe TJ, Tamir A (2002) Demand point aggregation for location models. In: Drezner Z, Hamacher HW (eds) Facility location. Springer, Berlin/Heidelberg, pp 207–232

    Chapter  Google Scholar 

  • Francis RL, Lowe TJ, Rayco MB, Tamir A (2008) Aggregation error for location models: survey and analysis. Ann Oper Res 167:171–208

    Article  Google Scholar 

  • Hansen P, Peeters D, Richard D, Thisse JF (1985) The minisum and minimax location problems revisited. Oper Res 33:1251–1265

    Article  Google Scholar 

  • Hwang M, Chiang C, Liu Y (2004) Solving a fuzzy set-covering problem. Math Comput Model 40:861–865

    Article  Google Scholar 

  • Karasakal O, Karasakal EK (2004) A maximal covering location model in the presence of partial coverage. Comput Oper Res 31:1515–1526

    Article  Google Scholar 

  • Karkazis J, Papadimitriou C (1992) A branch-and-bound algorithm for the location of facilities causing atmospheric pollution. Eur J Oper Res 58:363–373

    Article  Google Scholar 

  • Kim K, Murray AT (2008) Enhancing spatial representation in primary and secondary coverage location modeling. J Reg Sci 48:745–768

    Article  Google Scholar 

  • Kolen A, Tamir A (1990) Covering problems. In: Mirchandani P, Francis R (eds) Discrete location theory. Wiley, New York

    Google Scholar 

  • Kuby MJ (1987) Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems. Geogr Anal 19:315–329

    Article  Google Scholar 

  • Lei TL, Church RL (2013) A unified model for dispersing facilities. Geogr Anal 45:401–418

    Article  Google Scholar 

  • Li X, Zhao Z, Zhu X, Wyatt T (2011) Covering models and optimization techniques for emergency response facility location and planning: a review. Math Method Oper Res 74:281–310

    Article  Google Scholar 

  • Mladenović N, Plastria F, Urošević D (2005) Reformulation descent applied to circle packing problems. Comput Oper Res 32:2419–2434

    Article  Google Scholar 

  • Moon ID, Chaudhry SS (1984) An analysis of network location problems with distance constraints. Manag Sci 30:290–307

    Article  Google Scholar 

  • 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–136

    Article  Google Scholar 

  • Murray AT (2005) Geography in coverage modeling: exploiting spatial structure to address complementary partial service of areas. Ann Assoc Am Geogr 95:761–772

    Article  Google Scholar 

  • Murray AT, Church RL (1997) Solving the anti-covering location problem using lagrangian relaxation. Comput Oper Res 24:127–140

    Article  Google Scholar 

  • Murray AT, O’Kelly ME (2002) Assessing representation error in point-based coverage modeling. J Geogr Syst 4:171–191

    Article  Google Scholar 

  • 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–64

    Article  Google Scholar 

  • Murray AT, Tong D, Kim K (2009) Enhancing classic coverage location models. Int Reg Sci Rev 33:115–133

    Article  Google Scholar 

  • Plastria F (1992) Gbsss: the generalized big square small square method for planar single-facility location. Eur J Oper Res 62:163–174

    Article  Google Scholar 

  • Plastria F (2001) On the choice of aggregation points for continuous p-median problems: a case for the gravity centre. TOP 9:217–242

    Article  Google Scholar 

  • Plastria F (2002) Continuous covering location problems. In: Drezner Z, Hamacher HW (eds) Facility location. Springer, Berlin/Heidelberg, pp 39–83

    Google Scholar 

  • Plastria F, Carrizosa E (1999) Undesirable facility location with minimal covering objectives. Eur J Oper Res 119:158–180

    Article  Google Scholar 

  • Plastria F, Gordillo J, Carrizosa E (2013) Locating a semi-obnoxious covering facility with repelling polygonal regions. Discrete Appl Math 161:2604–2623

    Article  Google Scholar 

  • Romero-Morales D, Carrizosa E, Conde E (1997) Semi-obnoxious location models: a global optimization approach. Eur J Oper Res 102:295–301

    Article  Google Scholar 

  • Schilling DA, Jayaraman V, Barkhi R (1993) A review of covering problems in facility location. Locat Sci 1:25–55

    Google Scholar 

  • Schöbel A, Scholz D (2010) The big cube small cube solution method for multidimensional facility location problems. Comput Oper Res 37:115–122

    Article  Google Scholar 

  • Tong D (2012) Regional coverage maximization: a new model to account implicitly for complementary coverage. Geogr Anal 44:1–14

    Article  Google Scholar 

  • Tong D, Church RL (2012) Aggregation in continuous space coverage modeling. Int J Geogr Inf Sci 26:795–816

    Article  Google Scholar 

  • Tong D, Murray AT (2009) Maximising coverage of spatial demand for service. Pap Reg Sci 88:85–97

    Article  Google Scholar 

  • Wand MP, Jones MC (1993) Comparison of smoothing parameterizations in bivariate kernel density estimation. J Am Stat Assoc 88:520–528

    Article  Google Scholar 

  • Wand MP, Jones MC (1995) Kernel smoothing. Springer, New York

    Book  Google Scholar 

  • Yao J, Murray AT (2014) Serving regional demand in facility location. Pap Reg Sci 93:643–662

    Google Scholar 

Download references

Acknowledgements

Research partially supported by research grants and projects ICT COST Action TD1207 (EU), MTM2012-36163 (Ministerio de Ciencia e Innovación, Spain), P11-FQM-7603, FQM329 (Junta de Andalucía, Spain), all with EU ERDF funds.

Author information

Authors and Affiliations

  1. Instituto de Matemáticas de la Universidad de Sevilla, Universidad de Sevilla, Sevilla, Spain

    Emilio Carrizosa

  2. Faculty of Mathematics, Department of Differential Equations, Budapest University of Technology and Economics, 1111, Budapest, Egry József u. 1., Hungary

    Boglárka G.-Tóth

Authors
  1. Emilio Carrizosa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Boglárka G.-Tóth
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emilio Carrizosa .

Editor information

Editors and Affiliations

  1. HEC Montréal, Montréal, Canada

    Gilbert Laporte

  2. Institute of Operations Research (IOR), Karlsruhe Institute of Technology, Karlsruhe, Germany

    Stefan Nickel

  3. DEIO-FCUL, University of Lisbon, Lisbon, Portugal

    Francisco Saldanha da Gama

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Carrizosa, E., G.-Tóth, B. (2015). Anti-covering Problems. In: Laporte, G., Nickel, S., Saldanha da Gama, F. (eds) Location Science. Springer, Cham. https://doi.org/10.1007/978-3-319-13111-5_6

Download citation

Publish with us

Policies and ethics

Search

Navigation