Abstract
A new gradual cover competitive facility location model is proposed and tested. In cover competitive models, it is assumed that up to a certain distance a demand point is attracted to a facility and beyond this distance it is not. The decline in attraction and cover is abrupt. It is either 0 or 1. We propose a gradual decline in attraction from 1 to 0. As the distance increases the attraction and cover decline. The buying power captured by a facility cannot exceed its attraction level, and the total buying power captured by all facilities cannot exceed the buying power available at the demand point. The single-facility location is optimally solved. The largest problem of 1000 demand points is solved in less than one second. The multiple facility version is solved by SNOPT and other solvers.
Similar content being viewed by others
References
Al-Khayyal F, Tuy H, Zhou F (2002) Large-scale single facility continuous location by D.C. optimization. Optimization 51:271–292
Berman O, Drezner Z, Krass D (2010) Generalized coverage: new developments in covering location models. Comput Oper Res 37:1675–1687
Berman O, Drezner Z, Krass D (2019) The multiple gradual cover location problem. J Oper Res Soc 70:931–940
Berman O, Krass D (2002) The generalized maximal covering location problem. Comput Oper Res 29:563–591
Berman O, Krass D, Drezner Z (2003) The gradual covering decay location problem on a network. Eur J Oper Res 151:474–480
Black W (1984) Choice-set definition in patronage modeling. J Retail 60:63–85
Blanquero R, Carrizosa E (2009) Continuous location problems and big triangle small triangle: constructing better bounds. J Global Optim 45:389–402
Buffa ES (1976) Operations management: the management of productive systems. Wiley, Santa Barbara
Christaller W (1966) Central places in Southern Germany. Prentice-Hall, Englewood Cliffs, NJ
Church RL, ReVelle CS (1974) The maximal covering location problem. Pap Reg Sci Assoc 32:101–118
Church RL, Roberts KL (1984) Generalized coverage models and public facility location. Pap Reg Sci Assoc 53:117–135
Clark WAV (1968) Consumer travel patterns and the concept of range. Ann Assoc Am Geogr 58:386–396
Clark WAV, Rushton G (1970) Models of intra-urban behavior and their implications for central place theory. Econ Geogr 46:486–497
Drezner T (1994) Locating a single new facility among existing unequally attractive facilities. J Reg Sci 34:237–252
Drezner T (1995) Competitive facility location in the plane. In: Drezner Z (ed) Facility location: a survey of applications and methods. Springer, New York, pp 285–300
Drezner T (2014) A review of competitive facility location in the plane. Logist Res 7:1–12
Drezner T, Drezner Z (2012) Modelling lost demand in competitive facility location. J Oper Res Soc 63:201–206
Drezner T, Drezner Z (2014) The maximin gradual cover location problem. OR Spectrum 36:903–921
Drezner T, Drezner Z, Goldstein Z (2010) A stochastic gradual cover location problem. Naval Res Logist 57:367–372
Drezner T, Drezner Z, Kalczynski P (2011) A cover-based competitive location model. J Oper Res Soc 62:100–113
Drezner T, Drezner Z, Kalczynski P (2012) Strategic competitive location: improving existing and establishing new facilities. J Oper Res Soc 63:1720–1730
Drezner T, Drezner Z, Kalczynski P (2015) A leader-follower model for discrete competitive facility location. Comput Oper Res 64:51–59
Drezner T, Drezner Z, Kalczynski P (2016) The multiple markets competitive location problem. Kybernetes 45:854–865
Drezner T, Eiselt HA (2002) Consumers in competitive location models. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory. Springer, Berlin, pp 151–178
Drezner Z (1982) Competitive location strategies for two facilities. Reg Sci Urban Econ 12:485–493
Drezner Z (2007) A general global optimization approach for solving location problems in the plane. J Global Optim 37:305–319
Drezner Z, Kalczynski P, Salhi S (2019) The multiple obnoxious facilities location problem on the plane: a Voronoi based heuristic. OMEGA Int J Manag Sci 87:105–116
Drezner Z, Suzuki A (2004) The big triangle small triangle method for the solution of non-convex facility location problems. Oper Res 52:128–135
Drezner Z, Wesolowsky GO, Drezner T (1998) On the logit approach to competitive facility location. J Reg Sci 38:313–327
Drezner Z, Wesolowsky GO, Drezner T (2004) The gradual covering problem. Naval Res Log 51:841–855
Eiselt HA (2011) Equilibria in competitive location models. In: Eiselt HA, Marianov V (eds) Foundations of location analysis. Springer, Berlin, pp 139–162
Eiselt HA, Marianov V (2009) Gradual location set covering with service quality. Soc Econ Plan Sci 43:121–130
Eiselt HA, Marianov V, Drezner T (2015) Competitive location models. In: Laporte G, Nickel S, da Gama FS (eds) Location science. Springer, Berlin, pp 365–398
Farahani RZ, Asgari N, Heidari N, Hosseininia M, Goh M (2012) Covering problems in facility location: a review. Comput Ind Eng 62:368–407
Fetter FA (1924) The economic law of market areas. Q J Econ 38:520–529
García S, Marín A (2015) Covering location problems. In: Laporte G, Nickel S, da Gama FS (eds) Location science. Springer, Berlin, pp 93–114
Ghosh A, Craig CS (1986) An approach to determining optimal location for new services. J Mark Res 23:354–362
Ghosh A, Craig CS (1991) FRANSYS: a franchise location model. J Retail 67:212–234
Ghosh A, Rushton G (1987) Spatial analysis and location-allocation models. Van Nostrand Reinhold Company, New York
Gill PE, Murray W, Saunders MA (2005) SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev 47:99–131
Hakimi SL (1981) On locating new facilities in a competitive environment. In: Presented at the ISOLDE II conference, Skodsborg, Denmark
Hakimi SL (1983) On locating new facilities in a competitive environment. Eur J Oper Res 12:29–35
Hakimi SL (1986) \(p\)-Median theorems for competitive location. Ann Oper Res 6:77–98
Hakimi SL (1990) Locations with spatial interactions: competitive locations and games. In: Mirchandani PB, Francis RL (eds) Discrete location theory. Wiley, New York, pp 439–478
Hansen P, Peeters D, Thisse J-F (1981) On the location of an obnoxious facility. Sistemi Urbani 3:299–317
Hotelling H (1929) Stability in competition. Econ J 39:41–57
Huff DL (1964) Defining and estimating a trade area. J Mark 28:34–38
Huff DL (1966) A programmed solution for approximating an optimum retail location. Land Econ 42:293–303
Karasakal O, Karasakal E (2004) A maximal covering location model in the presence of partial coverage. Comput Oper Res 31:15–26
Launhardt W (1885) Mathematische Begründung der Volkswirthschaftslehre. W. Engelmann, Leipzig
Lee DT, Schachter BJ (1980) Two algorithms for constructing a Delaunay triangulation. Int J Parallel Prog 9:219–242
Lösch A (1954) The economics of location. Yale University Press, New Haven, CT
Ohya T, Iri M, Murota K (1984) Improvements of the incremental method of the Voronoi diagram with computational comparison of various algorithms. J Oper Res Soc Jpn 27:306–337
O’Kelly ME (1995) Inferred ideal weights for multiple facilities. In: Drezner Z (ed) Facility location: a survey of applications and methods. Springer, New York, pp 69–88
Plastria F (2002) Continuous covering location problems. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory. Springer, Berlin, pp 39–83
Reilly WJ (1931) The law of retail gravitation. Knickerbocker Press, New York
ReVelle C (1986) The maximum capture or sphere of influence problem: hotelling revisited on a network. J Reg Sci 26:343–357
ReVelle C, Toregas C, Falkson L (1976) Applications of the location set covering problem. Geogr Anal 8:65–76
Serra D, ReVelle C (1995) Competitive location in discrete space. In: Drezner Z (ed) Facility location: a survey of applications and methods. Springer, New York, pp 367–386
Serra D, Eiselt HA, Laporte G, ReVelle CS (1999) Market capture models under various customer-choice rules. Environ Plan 26:741–750
Snyder LV (2011) Covering problems. In: Eiselt HA, Marianov V (eds) Foundations of location analysis. Springer, Berlin, pp 109–135
Sugihara K, Iri M (1992) Construction of the voronoi diagram for “one million” generators in single-precision arithmetic. Proc IEEE 80:1471–1484
Sugihara K, Iri M (1994) A robust topology-oriented incremental algorithm for Voronoi diagram. Int J Comput Geom Appl 4:179–228
Tuy H (1995) DC optimization: theory, methods and algorithms. Handbook of global optimization. Springer, Boston, pp 149–216
Tuy H, Al-Khayyal F, Zhou F (1995) A D.C. optimization method for single facility location problems. J Global Optim 7:209–227
Wächter A, Biegler LT (2006) On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math Program 106:25–57
Wendell RE, Hurter AP (1973) Location theory, dominance and convexity. Oper Res 21:314–320
Zeller RE, Achabal DD, Brown LA (1980) Market penetration and locational conflict in franchise systems. Decis Sci 11:58–80
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Drezner, T., Drezner, Z. & Kalczynski, P. Gradual cover competitive facility location. OR Spectrum 42, 333–354 (2020). https://doi.org/10.1007/s00291-020-00585-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-020-00585-x