Abstract
The mail-order DVD rental company Netflix chooses distribution center locations so that most of its customers receive their DVDs within one business day via first-class U.S. Mail. Similarly, many municipalities aim to have fire crews reach 911 callers within a specified time, such as four minutes. Both of these are examples of the notion of coverage, a concept central to several classes of facility location models; it indicates whether a demand location is within a pre-specified radius (measured by distance, travel time, cost, or another metric) of its assigned facility. Homeowners are covered if they are within four minutes of the nearest fire station, and Netflix customers are covered if they are within one mailing day of a distribution center. Note that in the fire-station example, municipalities typically want to cover all residents (while minimizing the number of service stations to open), whereas Netflix wants to cover as many customers as possible (subject to a limit on the number of warehouses it may operate at any time, as specified by its capital budget). The fire-station problem is an example of the set covering location problem (SCLP), while Netflix’s problem is an example of the maximal covering location problem (MCLP). This chapter discusses both problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aytug H, Saydam C (2002) Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study. Eur J Oper Res 141:480–494
Batta R, Dolan JM, Krishnamurthy NN (1989) The maximal expected covering location problem revisited. Transp Sci 23:277–287
Berman O, Krass D (2002) Facility location problems with stochastic demands and congestion. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory. Springer, New York (Chapter 11)
Bramel J, Simchi-Levi D (1997) On the effectiveness of set covering formulations for the vehicle routing problem with time windows. Oper Res 45:295–301
Church R (1974) Synthesis of a class of public facilities location models. PhD thesis, The Johns Hopkins University, Baltimore
Church R, ReVelle C (1974) The maximal covering location problem. Pap Reg Sci Assoc 32:101–118
Church RL, Meadows B (1979) Location modelling using maximum service distance criteria. Geogr Anal 11:358–373
Church RL, Roberts KL (1983) Generalized coverage models and public facility location. Pap Reg Sci 53:117–135
Church RL, Stoms DM, Davis FW (1996) Reserve selection as a maximal covering location problem. Biol Conserv 76:105–112
Current J, Daskin MS, Schilling D (2002) Discrete network location models. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory. Springer, New York (Chapter 3)
Daskin MS (1982) Application of an expected covering model to emergency medical service system design. Decis Sci 13:416–439
Daskin MS (1983) A maximum expected covering location model: formulation, properties and heuristic solution. Transp Sci 17:48–70
Daskin MS (1995) Network and discrete location: models, algorithms, and applications. Wiley, New York
Daskin MS, Stern EH (1981) A hierarchical objective set covering model for emergency medical service vehicle deployment. Transp Sci 15:137–152
Daskin MS, Hogan K, ReVelle C (1988) Integration of multiple, excess, backup, and expected covering models. Environ Plan B 15:15–35
Daskin MS, Haghani AE, Khanal M, Malandraki C (1989) Aggregation effects in maximum covering models. Ann Oper Res 18:115–140
Eaton DJ, Daskin MS, Simmons D, Bulloch B, Jansma G (1985) Determining emergency medical service vehicle deployment in Austin, Texas. Interfaces 15:96–108
Eiselt HA, Sandblom C-L (2004) Decision analysis, location models, and scheduling problems. Springer, New York
Fisher ML (1981) The Lagrangian relaxation method for solving integer programming problems. Manag Sci 27:1–18
Fisher ML (1985) An applications oriented guide to Lagrangian relaxation. Interfaces 15:10–21
Flynn J, Ratick S (1988) A multiobjective hierarchical covering model for the essential air services program. Transp Sci 22:139–147
Galvão RD, Chiyoshi FY, Morabito R (2005) Towards unified formulations and extensions of two classical probabilistic location models. Comput Oper Res 32:15–33
Galvão RD, ReVelle C (1996) A Lagrangean heuristic for the maximal covering location problem. Eur J Oper Res 88:114–123
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York
Gleason JM (1975) A set covering approach to bus stop location. Omega 3:605–608
Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12:450–459
Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13:462–475
Larson RC (1974) A hypercube queuing model for facility location and redistricting in urban emergency services. Comput Oper Res 1:67–95
Larson RC (1975) Approximating the performance of urban emergency service systems. Oper Res 23:845–868
Marianov V, ReVelle C (1996) The queueing maximal availability location problem: a model for the siting of emergency vehicles. Eur J Oper Res 93:110–120
Megiddo N, Zemel E, Hakimi SL (1983) The maximum coverage location problem. SIAM J Algebra Discrete Method 4:253–261
Nozick LK, Turnquist MA (2001) Inventory, transportation, service quality and the location of distribution centers. Eur J Oper Res 129:362–371
Rajagopalan HK, Vergara FE, Saydam C, Xiao J (2007) Developing effective meta-heuristics for a probabilistic location model via experimental design. Eur J Oper Res 177:83–101
Rao A (1974) Counterexamples for the location of emergency service facilities. Oper Res 22:1259–1261
ReVelle C (1993) Facility siting and integer-friendly programming. Eur J Oper Res 65:147–158
ReVelle C, Hogan K (1989) The maximum availability location problem. Transp Sci 23:192–200
ReVelle C, Marks D, Liebman JC (1970) An analysis of private and public sector location models. Manag Sci 16:692–707
Schilling DA, ReVelle C, Cohon J, Elzinga DJ (1980) Some models for fire protection locational decisions. Eur J Oper Res 5:1–7
Snyder LV (2006) Facility location under uncertainty: a review. IIE Transactions 38:537–554
Storbeck JE (1982) Slack, natural slack and location covering. Socioecon Plan Sci 16:99–105
Toregas C, ReVelle C (1972) Optimal location under time or distance constraints. Pap Reg Sci Assoc 28:133–143
Toregas C, Swain R, ReVelle C, Bergman L (1971) The location of emergency service facilities. Oper Res 19:1363–1373
Toregas C, ReVelle C, Swain R (1974) Reply to Rao’s note on the location of emergency service facilities. Oper Res 22:1262–1267
White J, Case K (1973) On covering problems and the central facilities location problem. Unpublished paper, Virginia Polytechnic Institute and State University, Blacksburg
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Snyder, L.V. (2011). Covering Problems. 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_6
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7572-0_6
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-7571-3
Online ISBN: 978-1-4419-7572-0
eBook Packages: Business and EconomicsBusiness and Management (R0)