Advertisement

Capture, Capacities, and Thresholds

  • Richard L. Church
  • Alan Murray
Chapter
Part of the Advances in Spatial Science book series (ADVSPATIAL)

Abstract

There can be a number of different problem settings under which covering models can be defined and applied. Many of the models that are discussed in this chapter were originally inspired by issues associated with retail and competition. Although one at first blush may think of retail siting and coverage models as having little in common, except for something obvious like a pizza chain attempting to locate facilities so that it can deliver pizzas everywhere in a city within 30 min, there are surprisingly many retail elements that can be defined and addressed using coverage constructs.

References

  1. Balakrishnan PV, Storbeck JE (1991) McTHRESH: modeling maximum coverage with threshold constraints. Environ Plan B: Plan Des 18(4):459–472Google Scholar
  2. Benati S (1999) The maximum capture problem with heterogeneous customers. Comput Oper Res 26(14):1351–1367Google Scholar
  3. Carnes T, Shmoys D (2008) Primal-dual schema for capacitated covering problems. In: International conference on integer programming and combinatorial optimization. Springer, Berlin, pp 288–302Google Scholar
  4. Carreras M, Serra D (1999) On optimal location with threshold requirements. Socio-Econ Plan Sci 33(2):91–103Google Scholar
  5. Christaller W (1933) Central places in Southern Germany. The pioneer work in theoretical economic geography (trans: Carlisle Baskinin 1966). Prentice-Hall, Englewood CliffsGoogle Scholar
  6. Chung CH (1986) Recent applications of the maximal covering location planning (MCLP) model. J Oper Res Soc 37:735–746Google Scholar
  7. Chung CH, Schilling DA, Carbone R (1983) The capacitated maximal covering problem: a heuristic. In: Proceedings of 14th annual Pittsburgh conference on modeling and simulation, pp 1423–1428Google Scholar
  8. Church RL (1980) Developing solid waste planning regions for the Tennessee Valley Authority. In: Proceedings of the 11th annual Pittsburgh conference on modelling and simulation, vol 11, pp 1611–1618Google Scholar
  9. Church RL, Bell TL (1990) Unpacking central place geometry I: single level theoretical k systems. Geogr Anal 22(2):95–115Google Scholar
  10. Colomé R, Lourenço HR, Serra D (2003) A new chance-constrained maximum capture location problem. Ann Oper Res 122(1):121–139Google Scholar
  11. Current JR, Storbeck JE (1988) Capacitated covering models. Environ Plan B: Plan Des 15(2):153–163Google Scholar
  12. Current JR, Storbeck JE (1994) A multiobjective approach to design franchise outlet networks. J Oper Res Soc 45(1):71–81Google Scholar
  13. d’Aspremont C, Gabszewicz JJ, Thisse JF (1979) On Hotelling’s “Stability in competition”. Econ: J Econ Soc 1145–1150Google Scholar
  14. Dembski WA, Marks RJ (2009) Bernoulli’s principle of insufficient reason and conservation of information in computer search. In: IEEE international conference on systems, man and cybernetics, 2009. SMC 2009, IEEE, pp 2647–2652Google Scholar
  15. Drezner T, Drezner Z, Shiode S (2002) A threshold-satisfying competitive location model. J Reg Sci 42(2):287–299Google Scholar
  16. Dupont P (1977/78) Laplace and the Indifference Principle in the Essai philosophique des probabilités. Rend Sem Mat Univ Politec Torino 36:125–137Google Scholar
  17. Dwyer FR, Evans JR (1981) A branch and bound algorithm for the list selection problem in direct mail advertising. Manage Sci 27(6):658–667Google Scholar
  18. Eiselt HA, Laporte G (1989) The maximum capture problem in a weighted network. J Reg Sci 29(3):433–439Google Scholar
  19. Geoffrion A, Bride RM (1978) Lagrangean relaxation applied to capacitated facility location problems. AIIE Trans 10(1):40–47Google Scholar
  20. Gerrard RA (1996) The location of service facilities using models sensitive to response distance, facility workload, and demand allocation. PhD Dissertation, University of California, Santa BarbaraGoogle Scholar
  21. Gerrard RA, Church RL (1996) Closest assignment constraints and location models: properties and structure. Locat Sci 4(4):251–270Google Scholar
  22. Gutiérrez-Jarpa G, Donoso M, Obreque C, Marianov V (2010) Minimum cost path location for maximum traffic capture. Computers & Industrial Engineering 58(2):332–341Google Scholar
  23. Hansen P, Thisse JF (1981) Outcomes of voting and planning: Condorcet, Weber and Rawls locations. J Public Econ 16(1):1–15Google Scholar
  24. Hodgson MJ (1990) A flow-capturing location-allocation model. Geogr Anal 22(3):270–279Google Scholar
  25. Hodgson MJ, Rosing KE, Leontien A, Storrier G (1996) Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada. Eur J Oper Res 90(3):427–443Google Scholar
  26. Hong S, Kuby M (2016) A threshold covering flow-based location model to build a critical mass of alternative-fuel stations. J Transp Geogr 56:128–137Google Scholar
  27. Hotelling H (1929) Stability in competition. Econ J 39(1929):41–57Google Scholar
  28. Marković N, Ryzhov I, Schonfeld P (2015) Evasive flow capture: optimal location of weigh-in-motion systems, tollbooths, and security checkpoints. Networks 65(1):22–42Google Scholar
  29. Pirkul H, Schilling D (1989) The capacitated maximal covering location problem with backup service. Ann Oper Res 18(1):141–154Google Scholar
  30. Pirkul H, Schilling DA (1991) The maximal covering location problem with capacities on total workload. Manage Sci 37(2):233–248Google Scholar
  31. Reilly WJ (1929) Methods for study of retail relationships. Research Monograph, 4, Bureau of Business Research, The University of Texas, AustinGoogle Scholar
  32. ReVelle C (1986) The maximum capture or “sphere of influence” location problem: hotelling revisited on a network. J Reg Sci 26(2):343–358Google Scholar
  33. ReVelle C, Serra D (1991) The maximum capture problem including relocation. INFOR 29(2):130–138Google Scholar
  34. ReVelle C, Murray AT, Serra D (2007) Location models for ceding market share and shrinking services. Omega 35(5):533–540Google Scholar
  35. Salvaneschi L (1996) Location, location, location: how to select the best site for your business. Oasis Press/PSI Research, Grants PassGoogle Scholar
  36. Serra D, ReVelle C (1994) Market capture by two competitors: the preemptive location problem. J Reg Sci 34(4):549–561Google Scholar
  37. Serra D, Marianov V, ReVelle C (1992) The maximum-capture hierarchical location problem. Eur J Oper Res 62(3):363–371Google Scholar
  38. Serra D, Ratick S, ReVelle C (1996) The maximum capture problem with uncertainty. Environ Plan B: Plan Des 23(1):49–59Google Scholar
  39. Serra D, ReVelle C, Rosing K (1999) Surviving in a competitive spatial market: the threshold capture model. J Reg Sci 39(4):637–650Google Scholar
  40. Smogy C, Church RL (1985) Balancing access and service cover. Paper presented at the North American Meetings of the Regional Science Association, Philadelphia, PAGoogle Scholar
  41. Spaulding BD, Cromley RG (2007) Integrating the maximum capture problem into a GIS framework. J Geogr Syst 9(3):267–288Google Scholar
  42. Storbeck JE (1988) The spatial structuring of central places. Geogr Anal 20(2):93–110Google Scholar
  43. Storbeck JE (1990) Classical central places as protected thresholds. Geogr Anal 22(1):4–21Google Scholar
  44. Zeng W, Castillo I, Hodgson MJ (2010) A generalized model for locating facilities on a network with flow-based demand. Netw Spat Econ 10(4):579–611Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Richard L. Church
    • 1
  • Alan Murray
    • 1
  1. 1.Department of GeographyUniversity of CaliforniaSanta BarbaraUSA

Personalised recommendations