Advertisement

Cooperative Cover of Uniform Demand

  • Tammy DreznerEmail author
  • Zvi Drezner
Article
  • 40 Downloads

Abstract

We investigate the total covered area by multiple facilities applying the cooperative cover model. We found that the cooperative cover area is much larger than the one found by standard cover models. We also show that for a large number of facilities located in a symmetric grid, an hexagonal grid is best. We also investigate covering a given region, such as a square, by a given number of facilities with the weakest possible signal emitted by the facilities.

Keywords

Facility location Cover models Cooperative cover 

References

  1. Abramowitz M, Stegun I (1972) Handbook of mathematical functions. Dover, New YorkGoogle Scholar
  2. Atkinson KE (2008) An introduction to numerical analysis. Wiley, New YorkGoogle Scholar
  3. Averbakh I, Berman O, Krass D, Kalcsics J, Nickel S (2014) Cooperative covering problems on networks. Networks 63:334–349CrossRefGoogle Scholar
  4. Bagherinejad J, Bashiri M, Nikzad H (2018) General form of a cooperative gradual maximal covering location problem. Journal of Industrial Engineering International 14:241–253CrossRefGoogle Scholar
  5. Berman O, Krass D (2002) The generalized maximal covering location problem. Comput Oper Res 29:563–591CrossRefGoogle Scholar
  6. Berman O, Krass D, Drezner Z (2003) The gradual covering decay location problem on a network. Eur J Oper Res 151:474–480CrossRefGoogle Scholar
  7. Berman O, Drezner Z, Krass D (2010a) Cooperative cover location problems: the planar case. IIE Trans 42:232–246CrossRefGoogle Scholar
  8. Berman O, Drezner Z, Krass D (2010b) Generalized coverage: new developments in covering location models. Comput Oper Res 37:1675–1687CrossRefGoogle Scholar
  9. Berman O, Drezner Z, Krass D (2011) Discrete cooperative covering problems. J Oper Res Soc 62:2002–2012CrossRefGoogle Scholar
  10. Berman O, Drezner Z, Krass D (2013) Continuous covering and cooperative covering problems with a general decay function on networks. J Oper Res Soc 64:1644–1653CrossRefGoogle Scholar
  11. Berman O, Drezner Z, Krass D (2018) The multiple gradual cover location problem. Jornal of the Operational Research Society.  https://doi.org/10.1080/01605682.2018.1471376
  12. Beyer HW (1981) Standard mathematical tables. CRC press, Boca RatonGoogle Scholar
  13. Chelouah R, Siarry P (2003) Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions. Eur J Oper Res 148:335–348CrossRefGoogle Scholar
  14. Church RL, ReVelle C (1974) The maximal covering location problem. Papers of the Regional Science Association 32:101–118CrossRefGoogle Scholar
  15. Church RL, Roberts KL (1984) Generalized coverage models and public facility location. Papers of the Regional Science Association 53:117–135CrossRefGoogle Scholar
  16. Curtin KM, Hayslett-McCall K, Qiu F (2010) Determining optimal police patrol areas with maximal covering and backup covering location models. Networks and Spatial Economics 10:125–145CrossRefGoogle Scholar
  17. Dennis J, Woods DJ (1987) Optimization on microcomputers: the Nelder-Mead simplex algorithm. In: Wouk A. (ed) New computing environments: microcomputers in large-scale computing, pp 116–122. SIAM Publications, PhiladelphiaGoogle Scholar
  18. Dowell M, Jarratt P (1971) A modified regula falsi method for computing the root of an equation. BIT Numer Math 11:168–174CrossRefGoogle Scholar
  19. Drezner T, Drezner Z (2014) The maximin gradual cover location problem. OR Spectr 36:903–921CrossRefGoogle Scholar
  20. Drezner Z, Suzuki A (2010) Covering continuous demand in the plane. J Oper Res Soc 61:878–881CrossRefGoogle Scholar
  21. Drezner Z, Wesolowsky GO (2014) Covering part of a planar network. Networks and Spatial Economics 14:629–646CrossRefGoogle Scholar
  22. Drezner Z, Zemel E (1992) Competitive location in the plane. Ann Oper Res 40:173–193CrossRefGoogle Scholar
  23. Drezner Z, Wesolowsky GO, Drezner T (2004) The gradual covering problem. Nav Res Logist 51:841–855CrossRefGoogle Scholar
  24. Drezner T, Drezner Z, Goldstein Z (2010) A stochastic gradual cover location problem. Nav Res Logist 57:367–372Google Scholar
  25. Eiselt HA, Marianov V (2009) Gradual location set covering with service quality. Socio Econ Plan Sci 43:121–130CrossRefGoogle Scholar
  26. García S, Marín A (2015) Covering location problems. In: Laporte G, Nickel S, da Gama FS (eds) Location science, pp 93–114. Springer, HeidelbergGoogle Scholar
  27. Glover F, Laguna M (1997) Tabu search. Kluwer, BostonCrossRefGoogle Scholar
  28. Goehring L, Morris SW (2008) Scaling of columnar joints in basalt. J Geophys Res 113(B10203):1–18Google Scholar
  29. Hilbert D, Cohn-Vossen S (1956) Geometry and the imagination. Chelsea, New York. English translation of Anschauliche Geometrie (1932)Google Scholar
  30. Karasakal O, Karasakal E (2004) A maximal covering location model in the presence of partial coverage. Comput Oper Res 31:15–26CrossRefGoogle Scholar
  31. Karatas M (2017) A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover. Eur J Oper Res 262:1040–1051CrossRefGoogle Scholar
  32. Kirkpatrick S, Gelat CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680CrossRefGoogle Scholar
  33. Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100CrossRefGoogle Scholar
  34. Morohosi H, Furuta T (2017) Two approaches to cooperative covering location problem and their application to ambulance deployment. In: Operations research proceedings 2015, pp. 361–366. SpringerGoogle Scholar
  35. Murray AT, Matisziw TC, Wei H, Tong D (2008) A geocomputational heuristic for coverage maximization in service facility siting. Transactions in GIS 12(6):757–773CrossRefGoogle Scholar
  36. Nelder JA, Mead R (1965) A simplex method for function minimization. Comput J 7:308–313CrossRefGoogle Scholar
  37. Plastria F (2002) Continuous covering location problems. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory, pp. 39–83. SpringerGoogle Scholar
  38. Puu T (2005) On the genesis of hexagonal shapes. Networks and Spatial Economics 5:5–20CrossRefGoogle Scholar
  39. ReVelle C, Toregas C, Falkson L (1976) Applications of the location set covering problem. Geogr Anal 8:65–76CrossRefGoogle Scholar
  40. Snyder LV (2011) Covering problems. In: Eiselt HA, Marianov V (eds) Foundations of location analysis, pp. 109–135. SpringerGoogle Scholar
  41. Suzuki A, Drezner Z (1996) The p-center location problem in an area. Locat Sci 4:69–82CrossRefGoogle Scholar
  42. Szabo PG, Markot M, Csendes T, Specht E (2007) New approaches to circle packing in a square: with program codes. Springer, New YorkGoogle Scholar
  43. Torczon V (1989) Multi-directional search: a direct search method for parallel machines. PhD thesis, Department of Mathematical Sciences, Rice University, Houston, TXGoogle Scholar
  44. Wendell RE, Hurter AP (1973) Location theory, dominance and convexity. Oper Res 21:314–320CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Steven G. Mihaylo College of Business EconomicsCalifornia State University-FullertonFullertonUSA

Personalised recommendations