Skip to main content
SpringerLink
Log in

Hazardous Facility Location Models on Networks

  • Chapter
  • First Online:
Book cover Handbook of OR/MS Models in Hazardous Materials Transportation

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

Abstract

This chapter aims to be a comprehensive compilation of references and methods dealing with undesirable facility location on networks. In this sense, more than 90 papers have been briefly commented, along with several models on undesirable single facility location on networks with multiple criteria that have been analyzed and described.

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

  • Alumur S, Kara BY (2007) A new model for the hazardous waste location-routing problem. Comput Oper Res 34(5):1406–1423

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Berman O, Wang J (2004) Probabilistic location problems with discrete demand weights. Networks 44(1):47–57

    Article  Google Scholar 

  • Berman O, Wang J (2006) The 1-median and 1-antimedian problems with continuous probabilistic demand weights. INFOR 44(4):267–283

    Google Scholar 

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

    Article  Google Scholar 

  • Berman O, Wang Q (2008) Locating a semi-obnoxious facility with expropriation. Comput Oper Res 35(2):392–403

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Berman O, Verter V, Kara B (2007) Designing emergency response networks for hazardous materials transportation. Comput Oper Res 34(5):1374–1388

    Article  Google Scholar 

  • Burkard RE, Dollani H (2003) Center problems with pos/neg weights on tree. Euro J Oper Res 145(3):483–495

    Article  Google Scholar 

  • Burkard RE, Dollani H, Lin Y, Rote G (2001) The obnoxious center problem on a tree. SIAM J Discrete Math 14(4):498–509

    Article  Google Scholar 

  • Cáceres T, Mesa JA, Ortega FA (2007) Locating waste pipelines to minimize their impact on marine environment. Euro J Oper Res 179(3):1143–1159

    Article  Google Scholar 

  • Cappanera P (1999) “A survey on obnoxious facility location problems”, Technical Report 11, Dipartamento di Informatica, Università di Pisa

    Google Scholar 

  • Cappanera P, Gallo G, Maffioli F (2003) Discrete facility location and routing of obnoxious activities. Discrete Appl Math 133(1–3):3–28

    Article  Google Scholar 

  • Carrizosa E, Conde E (2002) A fractional model for locating semi-desirable facilities on networks. Euro J Oper Res 136(1):67–80

    Article  Google Scholar 

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

    Google Scholar 

  • Chan Y (2005) Location, transport and land-use: modelling spatial-temporal information. Springer, New York

    Google Scholar 

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

    Article  Google Scholar 

  • Colebrook M, Alonso S, Sicilia J (2005) “A new software tool to solve multicriteria facility location problems on networks” (invited session). In: Proceedings of the Triennial Conference of the International Federation of Operational Research Societies (IFORS 2005)

    Google Scholar 

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

    Article  Google Scholar 

  • Colebrook M, Gutiérrez J, Alonso S, Sicilia J (2002) A new algorithm for the undesirable 1-center problem on networks. J Oper Res Soc 53(12):1357–1366

    Article  Google Scholar 

  • Colebrook M (2003) Desirable and undesirable single facility location on networks with multiple criteria. Ph.D. dissertation, Universidad de La Laguna, Tenerife, Spain

    Google Scholar 

  • Colebrook M, Sicilia J (2006) An O(mn) algorithm for the anti-cent-dian problem. Appl Math Comput 183(1):350–364

    Article  Google Scholar 

  • Colebrook M, Sicilia J (2007) Undesirable facility location problems on multicriteria networks. Comput Oper Res 34(5):1491–1514

    Article  Google Scholar 

  • Current J, Min H, Schilling D (1990) Multiobjective analysis of facility location decisions. Eur J Oper Res 49(3):295–307

    Article  Google Scholar 

  • Daskin MS (1995) Network and discrete location: models, algorithms and applications. Wiley, New York

    Book  Google Scholar 

  • Domschke W, Drexl A (1985) Location and layout planning: an international bibliography. Springer, Berlin

    Book  Google Scholar 

  • Drezner Z (ed) (1995) Facility location: a survey of applications and methods. Springer, New York

    Google Scholar 

  • Drezner T, Drezner Z, Scott CH (2009) Location of a facility minimizing nuisance to or from a planar network. Comput Oper Res 36(1):135–148

    Article  Google Scholar 

  • Drezner Z, Hamacher HW (eds) (2004) Facility location: applications and theory. Springer, New York

    Google Scholar 

  • Drezner Z, Wesolowsky GO (1995) Obnoxious facility location in the interior of a planar network. J Regional Sci 35(4):675–688

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Eiselt HA, Sandblom C-L (2004) Decision analysis, location models, and scheduling problems. Springer, New York

    Google Scholar 

  • Eiselt HA, Marianov V (2011) Foundations of Location Analysis. Springer, New York

    Book  Google Scholar 

  • Erkut E, Alp O (2007) Designing a road network for hazardous materials shipments. Comput Oper Res 34(5):1389–1405

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Erkut E, Neuman S (1992) A multiobjective model for locating undesirable facilities. Ann Oper Res 40:209–227

    Article  Google Scholar 

  • Erkut E, Verter V (1995) Hazardous materials logistics. In: Drezner Z (ed) Facility locations: a survey of applications and methods. Springer, New York, pp 467–506

    Chapter  Google Scholar 

  • Farahani RZ, Hekmatfar M (2009) Facility location: concepts, models, algorithms and case studies. Springer, New York

    Google Scholar 

  • Friedrich F (1929) Alfred Weber’s theory of the location of industries. Chicago University Press, Chicago, IL

    Google Scholar 

  • Giannikos I (1998) A multiobjective programming model for locating treatment sites and routing hazardous wastes. Euro J Oper Res 104(2):333–342

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Hale T (1998) Location science references. http://gator.dt.uh.edu/~halet/

  • 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(1–4):33–53

    Article  Google Scholar 

  • Hansen P, Labbé M, Thisse J-F (1991) From the median to the generalized center. Recherche Operationnelle/Oper Res 25(1):73–86

    Google Scholar 

  • Hershberger J (1989) Finding the upper envelope of n line segments in O(n log n) time. Inform Process Lett 33(4):169–174

    Article  Google Scholar 

  • Hosseini S, Esfahani AM (2009) Obnoxious Facility Location. In: Farahani RZ, Hekmatfar M (eds) Facility location: concepts, models, algorithms and case studies. Springer, New York

    Google Scholar 

  • Hokkanen J, Salminen P (1997) Locating a waste treatment facility by multicriteria analysis. J Multi-Crit Decis Anal 6(3):175–184

    Article  Google Scholar 

  • Jordan C (1869) Sur les assamblages de lignes. Zeitschrift Reine Angew Math 70:185–190

    Article  Google Scholar 

  • Kincaid RK, Berger RT (1994) The maxminsum problem on trees. Location Sci 2(1):1–9

    Google Scholar 

  • Krarup J, Pruzan PM (1990) Ingredients of locational analysis. In: Mirchandani PB, Francis RL (eds) Discrete location theory. Wiley, New York, pp 1–54

    Google Scholar 

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

    Article  Google Scholar 

  • Labbé M (1990) Location of an obnoxious facility on a network—a voting approach. Networks 20(2):197–207

    Article  Google Scholar 

  • List GF, Mirchandani PB (1991) An integrated network/planar multiobjective model for routing and siting for hazardous materials and wastes. Transport Sci 25(2):146–156

    Article  Google Scholar 

  • López-de-los-Mozos MC, Mesa JA (2001) The maximum absolute deviation measure in location problems on networks. Euro J Oper Res 135(1):184–194

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Melachrinoudis E (2011) The location of undesirable facilities. In: Eiselt HA, Marianov V (eds) Foundations of location analysis. Springer, New York

    Google Scholar 

  • Melachrinoudis E, Min H, Wu X (1995) A multiobjective model for the dynamic location of landfills. Location Sci 3(3):143–166

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Mirchandani PB, Francis RL (eds) (1990) Discrete location theory. Wiley, New York

    Google Scholar 

  • Moon ID (1989) Maximin center of pendant vertices in a tree network. Transport Sci 23(3): 213–216

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Moreno-Pérez JA, Rodríguez-Martín I (1999) Anti-cent-dian on networks. Stud Locational Anal 12:29–39

    Google Scholar 

  • Murray AT, Church RL, Gerrard RA, Tsui WS (1998) Impact models for siting undesirable facilities. Papers Reg Sci 77(1):19–36

    Google Scholar 

  • Nickel S, Puerto J (2005) Location theory: a unified approach, Springer, Berlin

    Article  Google Scholar 

  • Pareto V (1896) Cours d’economie politique, F. Rouge, Lausanne 1

    Google Scholar 

  • Plastria F (1996) Optimal location of undesirable facilities: a selective overview. Belgian J Oper Res Stat Comput Sci 36(2–3):109–127

    Google Scholar 

  • Puerto J (ed) (1996) Lecturas en teoría de localización. Universidad de Sevilla, Secretariado de Publicaciones

    Google Scholar 

  • Rahman M, Kuby M (1995) A multiobjective model for locating solid waste transfer facilities using an empirical opposition function. INFOR 33(1):34–49

    Google Scholar 

  • Rakas J, Teodorović D, Kim T (2004) Multi-objective modeling for determining location of undesirable facilities. Transport Res Part D Transport Environ 9(2):125–138

    Article  Google Scholar 

  • Ratick SJ, White AL (1988) A risk-sharing model for locating noxious facilities. Environ Plann B 15(2):165–179

    Article  Google Scholar 

  • ReVelle CS, Cohon JL, Shobrys D (1981a) Multiple objective facility location. Sistemi Urbani 3:319–343

    Google Scholar 

  • ReVelle CS, Cohon JL, Shobrys D (1981b) Multiple objectives in facility location: a review. Lecture notes in economic and mathematical systems, organisations: multiple agents with multiple criteria, vol 190. Springer, pp 321–337

    Google Scholar 

  • Ross GT, Soland RM (1980) A multicriteria approach to the location of public facilities. Eur J Oper Res 4(5):307–321

    Article  Google Scholar 

  • Saameño JJ (1992) Localización multicriterio de centros peligrosos. Ph.D. thesis, Universidad de Sevilla

    Google Scholar 

  • Salhi S, Welch SB, Cunninghame-Green RA (2000) An enhancement of an analytical approach: the case of the weighted maximin network location problem. Math Algorith 1(4):315–329

    Google Scholar 

  • Skriver AJV (2001) Multicriteria analysis on network and location problems. Ph.D. thesis, University of Aarhus

    Google Scholar 

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

    Article  Google Scholar 

  • Slater P (1975) Maximin facility location. J Res Natl Bur Stand 79B(3–4):107–115

    Google Scholar 

  • Steuer RE (1986) Multiple criteria optimization: theory, computation and application. Wiley, New York

    Google Scholar 

  • Stowers CL, Palekar US (1993) Location models with routing considerations for a single obnoxious facility. Transport Sci 27(4):350–362

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Tamir A (2001) “Comment on E. Melachrinoudis and F.G.-S. Zhang, An O(mn) algorithm for the 1-maximin problem on a network, Computers & Operations Research 26 (1999) 849–869, Comput Oper Res 28(2), 189

    Google Scholar 

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

    Article  Google Scholar 

  • Tuzkaya G, Önüt S, Tuzkaya UR, Gülsün B (2008) An analytic network process approach for locating undesirable facilities: an example from Istanbul, Turkey. J Environ Manage 88(4): 970–983

    Article  Google Scholar 

  • Verter V, Erkut E (1995) Hazardous materials logistics: an annotated bibliography. In: Haurie A, Carraro C (eds) Operations Research and Environmental Management. Kluwer, Dordecht, pp 221–267

    Google Scholar 

  • Yamaguchi K (2011) Location of an undesirable facility on a network: a bargaining approach. Math Soc Sci 62(2):104–108

    Article  Google Scholar 

  • Zemel E (1984) An O(n) algorithm for the linear multiple choice knapsack and related problems. Informat Process Lett 18(3):123–128

    Article  Google Scholar 

  • Zhang FG (1996) Location on networks with multiple criteria. Ph.D. thesis, Northeastern University, Boston, MA

    Google Scholar 

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

    Article  Google Scholar 

  • Zhang J, Hodgson J, Erkut E (2000) Using GIS to assess the risks of hazardous materials transport in networks. Euro J Oper Res 121(2):316–329

    Article  Google Scholar 

  • Zhao J, Shuai B (2010) A new multi-objective model of location-allocation in emergency response network design for hazardous materials transportation. In: Proceedings of the 2010 IEEE International Conference on Emergency Management and Management Sciences (ICEMMS 2010), 246–249

    Chapter  Google Scholar 

Download references

Acknowledgments

This work has been partially supported by Ministerio de Ciencia e Innovación, Spanish Government, research projects MTM2010-18591 and MTM2009-08830.

Author information

Authors and Affiliations

  1. Depto. Estadística, Investigación Operativa y Computación, Universidad de La Laguna, Tenerife, Spain

    Marcos Colebrook & Joaquín Sicilia

Authors
  1. Marcos Colebrook
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joaquín Sicilia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcos Colebrook .

Editor information

Editors and Affiliations

  1. The State University of New York, Dept of Industrial & Systems Engineering, University at Buffalo, Bonner Hall 412G, Buffalo, 14260, New York, USA

    Rajan Batta

  2. The State University of New York, ISE Department, University at Buffalo, Bell Hall 400, Buffalo, 14260, New York, USA

    Changhyun Kwon

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

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. International Series in Operations Research & Management Science, vol 193. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6794-6_6

Download citation

Publish with us

Policies and ethics

Search

Navigation