Skip to main content
SpringerLink
Log in

The Location of Undesirable Facilities

  • Chapter
  • First Online:
Foundations of Location Analysis

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 155))

Abstract

Undesirable facilities are those facilities that have adverse effects on people or the environment. They generate some form of pollution, nuisance, potential health hazard, or danger to nearby residents; they also may harm nearby ecosystems. Examples are incinerators, landfills or sewage plants, airports, stadia, repositories of hazardous wastes, nuclear or chemical plants, prisons, and military installations. Although they provide some disservice to nearby residents, these facilities are necessary to society. In addition, there is often some travel involved to and from these facilities and an associated transportation cost that increases with distance from the population, which in turn suggests that they should be placed away but not very far away. The terms semi-obnoxious and semi-desirable have also been used for some of these facilities, but the undesirable features (perceived or real) of these facilities dominate the desirable ones. Since the analytical models used for locating these facilities do not change much with their degree of undesirability, as Erkut and Neuman (1989) suggested, we will use the term undesirable for all of them.

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 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Appa GM, Giannikos I (1994) Is linear programming necessary for single facility location with maximin of rectilinear distance? J Oper Res Soc 45:97–107

    Google Scholar 

  • Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice Hall, Englewood Cliffs

    Google Scholar 

  • Berman O, Drezner Z (2000) A note on the location of an obnoxious facility on a network. Eur J Oper Res 120:215–217

    Google Scholar 

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

    Google Scholar 

  • Berman O, Wang Q (2007) Locating semi-obnoxious facilities with expropriation: minisum criterion. J Oper Res Soc 58:378–390

    Google Scholar 

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

    Google Scholar 

  • Berman O, Drezner Z, Wesolowsky GO (2003) The expropriation location model. J Oper Res Soc 54:769–776

    Google Scholar 

  • Brady SD, Rosenthal RE (1980) Interactive computer graphical solutions of constrained minimax problems. AIIE Trans 12:241–248

    Google Scholar 

  • Brimberg J, Juel H (1998) A bicriteria model for locating a semi-desirable facility in the plane. Eur J Oper Res 106:144–151

    Google Scholar 

  • Chandrasekaran R, Daughety A (1981) Location on tree networks: p-centre and n-dispersion problems. Math Oper Res 6:50–57

    Google Scholar 

  • Chhajed D, Lowe TJ (1994) Solving structured multifacility location problems efficiently. Transp Sci 28:104–115

    Google Scholar 

  • Church RL, Garfinkel RS (1978) Locating an obnoxious facility on a network. Transp Sci 2:107–118

    Google Scholar 

  • Colebrook M, Gutierrez J, Sicilia J (2005) A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks. Comput Oper Res 32:309–325

    Google Scholar 

  • Dasarathy B, White LJ (1980) A maxmin location problem. Oper Res 28:1385–1401

    Google Scholar 

  • Drezner Z, Wesolowsky GO (1980) A maximin location problem with maximum distance constraints. AIIE Transactions 12:249–252

    Google Scholar 

  • Drezner Z, Wesolowky GO (1983) Location of an obnoxious facility with rectangular distances. J Reg Sci 23:241–248

    Google Scholar 

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

    Google Scholar 

  • Dyer ME (1984) Linear time algorithms for two and three-variable linear programs. SIAM J Comput 13:31–45

    Google Scholar 

  • Eiselt HA, Laporte G (1995) Objectives in location problems. In: Drezner Z (ed) Facility location, a survey of applications and methods. Springer, Berlin, pp 151–180

    Google Scholar 

  • Erkut E (1990) The discrete p-dispersion problem. Eur J Oper Res 46:48–60

    Google Scholar 

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

    Google Scholar 

  • Erkut E, Öncü TS (1991) A parametric 1-maximin location problem. J Oper Res Soc 42:49–55

    Google Scholar 

  • Francis RL (2008) A discussion of some location problems global warming can cause. Abstract, ISOLDE 11:139

    Google Scholar 

  • Goldman AJ (2006) Optimal facility-location. J Res Nat Inst Stand Technol 111:97–101

    Google Scholar 

  • Goldman AJ, Dearing PM (1975) Concepts of optimal location for partially noxious facilities. Bull Oper Res Soc Am 23(Suppl 1):B-31

    Google Scholar 

  • Hadley G (1964) Nonlinear and dynamic programming. Addison-Wesley, Reading

    Google Scholar 

  • Hakimi SL (1964) Optimal location of switching centers and the absolute centers and medians of a graph. Oper Res 12:450–459

    Google Scholar 

  • Hamacher HW, Labbé M, Nickel S, Skriver AJV (2002) Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives. Ann Oper Res 110:33–53

    Google Scholar 

  • Hansen P, Peeters D, Thisse JF (1981) On the location of an obnoxious facility. Sistemi Urbani 3:299–317

    Google Scholar 

  • Hooker JN, Garfinkel RS, Chen CK (1991) Finite dominating sets for network location problems. Oper Res 3:100–118

    Google Scholar 

  • Karkazis J (1988) The general unweighted problem of locating obnoxious facilities on the plane. Belgian J Oper Res Stat Comput Sci 28:43–49

    Google Scholar 

  • Karkazis J, Boffey C (1994) Modeling pollution spread. Stud Locat Anal 7:91–104

    Google Scholar 

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

    Google Scholar 

  • Kincaid RK (1992) Good solutions to discrete noxious location problems via metaheuristics. Ann Oper Res 40:265–281

    Google Scholar 

  • Klein CM, Kincaid RK (1994) The discrete anti-p-center problem. Transp Sci 28:77–79

    Google Scholar 

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

    Google Scholar 

  • Lipscomb DM, Taylor AC Jr (1978) Noise control, handbook of principles and practices. Van Nostrand Reinhold, New York

    Google Scholar 

  • Megiddo N (1982) Linear-time algorithms for linear programming in \({\mathbb{R}^3}\) and related problems. SIAM J Comput 4:759–776

    Google Scholar 

  • Mehrez A, Sinuany-Stern Z, Stulman A (1985) A single facility location problem with a weighted maximin-minimax rectilinear distance. Comput Oper Res 12:51–60

    Google Scholar 

  • Mehrez A, Sinuany-Stern Z, Stulman A (1986) An enhancement of the Drezner-Wesolowsky algorithm for single facility location with maximin of rectilinear distance. J Oper Res Soc 37:971–977

    Google Scholar 

  • Melachrinoudis E (1985) Determining an optimal location for an undesirable facility in a workroom environment. Appl Math Model 9:365–369

    Google Scholar 

  • Melachrinoudis E (1988) An efficient computational procedure for the rectilinear maximin location problem. Transp Sci 22:217–223

    Google Scholar 

  • Melachrinoudis E (1999) Bicriteria location of a semi-obnoxious facility. Comput Ind Eng 37:581–593

    Google Scholar 

  • Melachrinoudis E, Cullinane TP (1985) Locating an undesirable facility within a geographical region using the maximin criterion. J Reg Sci 25:115–127

    Google Scholar 

  • Melachrinoudis E, Cullinane TP (1986a) Locating an undesirable facility within a polygonal region. Ann Oper Res 6:137–145

    Google Scholar 

  • Melachrinoudis E, Cullinane TP (1986b) Locating an undesirable facility with a minimax criterion. Eur J Oper Res 24:239–246

    Google Scholar 

  • Melachrinoudis E, Smith JM (1995) An O(mn 2) algorithm for the maximin problem in E 2. Oper Res Lett 18:25–30

    Google Scholar 

  • Melachrinoudis E, Xanthopulos Z (2003) Semi-obnoxious single facility location in Euclidean space. Comput Oper Res 30:2191–2209

    Google Scholar 

  • Melachrinoudis E, Zhang FG (1999) An O(mn) algorithm for the 1-maximin problem on a network. Comput Oper Res 26:849–869

    Google Scholar 

  • Min H, Melachrinoudis E, Wu X (1997) Dynamic expansion and location of an airport: a multiple objective approach. Transp Res—Part A 31:403–417

    Google Scholar 

  • Minieka E (1983) Anticenters and antimedians of a network. Networks 13:359–364

    Google Scholar 

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

    Google Scholar 

  • Murray AT, Church RL (2008) Location analysis and GIS. Abstract, ISOLDE 11:105

    Google Scholar 

  • Nadirler D, Karasakal E (2008) Mixed integer programming-based solution procedure for single-facility location with maximin of rectilinear distance. J Oper Res Soc 59:563–570

    Google Scholar 

  • Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177:649–672

    Google Scholar 

  • Pisinger D (2006) Upper bounds and exact algorithms for the p-dispersion problems. Comput Oper Res 33:1380–1398

    Google Scholar 

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

    Google Scholar 

  • Plastria F (1996) Optimal location of undesirable facilities: a selective overview. JORBEL 36:109–127

    Google Scholar 

  • Plastria F, Carrizosa E (1999) Undesirable facility location with minimal covering objectives. Eur J Oper Res 121:302–319

    Google Scholar 

  • Revelle CS, Eiselt HA (2005) Location analysis: a synthesis and survey. Eur J Oper Res 165:1–19

    Google Scholar 

  • Saameno JJ, Guerrero C, Munoz J, Merida E (2006) A general model for the undesirable single facility location problem. Oper Res Lett 34:427–436

    Google Scholar 

  • Sayin S (2000) A mixed integer programming formulation for the 1-maximin problem. J Oper Res Soc 51:371–375

    Google Scholar 

  • Shamos MI (1975) Geometric complexity. Proceedings of the seventh ACM symposium on Theory of Computing, pp 224–233

    Google Scholar 

  • Shamos MI, Hoey D (1975) Closest-point problems. 16th annual symposium on foundations of computer science, pp 151–162

    Google Scholar 

  • Skriver AJV, Andersen KA (2001) The bicriterion semi-obnoxious location (BSL) problem solved by an ε-approximation. Eur J Oper Res 146:517–528

    Google Scholar 

  • Steuer ER (1989) Multiple criteria optimization: theory, computation, and application. Krieger, Malabar

    Google Scholar 

  • Sylvester JJ (1857) A question in the geometry of situation. Q J Pure Appl Math 1:79

    Google Scholar 

  • Tamir A (1988) Improved complexity bounds for center location problems on networks by using dynamic data structures. SIAM J Discrete Math 1:377–396

    Google Scholar 

  • Tamir A (1991) Obnoxious facility location on graphs. SIAM J Discrete Math 4:550–567

    Google Scholar 

  • Ting SS (1984) A linear time algorithm for maxisum facility location on tree networks. Transp Sci 18:76–84

    Google Scholar 

  • Yapicioglu H, Smith AE, Dozier G (2007) Solving the semi-desirable facility location problem using the bi-objective particle swarm. Eur J Oper Res 177:733–749

    Google Scholar 

  • Zhang FG, Melachrinoudis E (2001) The maximin-maxisum network location problem. Comput Optim Appl 19:209–234

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical and Industrial Engineering, Northeastern University, 360 Huntington Avenue, 02115, Boston, MA, USA

    Emanuel Melachrinoudis

Authors
  1. Emanuel Melachrinoudis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emanuel Melachrinoudis .

Editor information

Editors and Affiliations

  1. Faculty of Business Administration, University of New Brunswick, Fredericton,, New Brunswick, Canada

    H. A. Eiselt

  2. Depto. Ingenieria Electrica, Pontificia Universidad Católica de Chile, Av. Vicuna Mackenna 4860, Macul, Santiago, Chile

    Vladimir Marianov

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Melachrinoudis, E. (2011). The Location of Undesirable Facilities. In: Eiselt, H., Marianov, V. (eds) Foundations of Location Analysis. International Series in Operations Research & Management Science, vol 155. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7572-0_10

Download citation

Publish with us

Policies and ethics

Search

Navigation