Browse > Article

A GIS-based Geometric Method for Solving the Competitive Location Problem in Discrete Space  

Lee, Gun-Hak (Department of Geography Education, Chonnam National University)
Publication Information
Journal of the Korean Geographical Society / v.46, no.3, 2011 , pp. 366-381 More about this Journal
Abstract
A competitive location problem in discrete space is computationally difficult to solve in general because of its combinatorial feature. In this paper, we address an alternative method for solving competitive location problems in discrete space, particularly employing deterministic allocation. The key point of the suggested method is to reducing the number of predefined potential facility sites associated with the size of problem by utilizing geometric concepts. The suggested method was applied to the existing broadband marketplace with increasing competition as an application. Specifically, we compared computational results and spatial configurations of two different sized problems: the problem with the original potential sites over the study area and the problem with the reduced potential sites extracted by a GIS-based geometric algorithm. The results show that the competitive location model with the reduced potential sites can be solved more efficiently, while both problems presented the same optimal locations maximizing customer capture.
Keywords
competitive location problem; deterministic allocation; GIS-based geometric algorithm; weighted Voronoi diagram;
Citations & Related Records
연도 인용수 순위
  • Reference
1 O'Kelly, M. E. and Miller, H. J., 1989, A synthesis of some market area delimitation models, Growth and Change, 20, 14-33.   DOI
2 O'Kelly, M. E., 1987, Spatial-interaction-based locationallocation models, in Ghosh, A. and Rushton, G.(eds.), Spatial analysis and location-allocation models, Van Nostrand Reinhold Company, New York, 302-326.
3 Okabe, A. and Suzuki, A., 1997, Locational optimization problems solved through Voronoi diagrams, European Journal of Operational Research, 98, 445-456.   DOI   ScienceOn
4 Okabe, A., Boots, B., Sugihara, K., and Chiu, S. N., 2000, Spatial tessellations: Concepts and applications of Voronoi diagrams, John Wiley and Sons, New York.
5 Plastria, F., 2001, Static competitive facility location: an overview of optimisation approaches, European Journal of Operational Research, 129, 461-470.   DOI   ScienceOn
6 Plastria, F. and Carrizosa, E., 2004, Optimal location and design of a competitive facility, Mathematical Programming, 100(2), 247-265.   DOI   ScienceOn
7 Goodchild, M. F., 1984, ILACS: A location-allocation model for retail site selection, Journal of Retailing, 60, 84-100.
8 Grubesic, T. H., 2008, Spatial data constraints: Implications for measuring broadband, Telecommunication Policy, 32(7), 490-502.   DOI   ScienceOn
9 Grubesic, T. H. and Murray, A. T., 2002, Constructing the divide: spatial disparities in broadband access, Papers in Regional Science, 81, 197-221.   DOI   ScienceOn
10 Hakimi, S. L., 1964, Optimal location of switching centers and the absolute centers and medians of a graph, Operations Research, 12, 450-459.   DOI   ScienceOn
11 Hakimi, S. L. 1983, On locating new facilities in a competitive environment, European Journal of Operational Research, 12, 29-35.   DOI   ScienceOn
12 Hotelling, H., 1929, Stability in competition, Economic Journal, 39, 41-57.   DOI   ScienceOn
13 Huff, D. L., 1964, Defining and estimating a trading area, Journal of Marketing, 28, 24-38.
14 ReVelle, C. S. and Eiselt, H. A., 2005, Location analysis: A synthesis and survey, European Journal of Operational Research, 165, 1-19.   DOI   ScienceOn
15 Reilly, W. J., 1931, The law of retail gravitation, Knickerbocker Press, New York.
16 ReVelle, C. S. and Serra, D., 1991, The maximum capture problem including relocation, Information and Operations Research, 29, 130-138.   DOI
17 ReVelle, C. S., 1986, The maximum capture or sphere of influence problem: Hotelling revisited on a network, Journal of Regional Science, 26, 343-357.   DOI
18 Zhang, L. and Rushton, G., 2008, Optimizing the size and locations of facilities in competitive multisite service systems, Computers and Operations Research, 35, 327-338.   DOI   ScienceOn
19 Aurenhammer, F. and Edelsbrunner., H., 1984, An optimal algorithm for constructing the weighted Voronoi diagram in the plane, Pattern Recognition, 17(2), 251-257.   DOI   ScienceOn
20 Achabal, D. D., Gorr, G. L., and Mahajan, V., 1982, MULTILOC: A multiple store location model, Journal of Retailing, 58(2), 5-25.
21 Boots, B. and South, R., 1997, Modeling retail trade areas using higher-order, multiplicatively weighte Voronoi diagrams, Journal of Retailing, 73(4), 519-536.   DOI   ScienceOn
22 Church, R. L., 1984, The planar maximal covering location problem, Journal of Regional Science, 24(2), 185-201.   DOI
23 Nakanishi, M. and Cooper, L. G., 1974, Parameter estimation for a multiplicative competitive interaction model: Least squares approach, Journal of Marketing Research, 11(3), 303-311.   DOI   ScienceOn
24 Church, R. L., 2002, Geographical information systems and location science, Computers and Operations Research, 29, 541-562.   DOI   ScienceOn
25 Church, R. L. and ReVelle, C. S., 1974, The maximal covering location problem, Papers of the Regional Science Association, 32, 101-118.   DOI
26 Current, J., Hokey, M., and Schilling, D., 1990, Multiobjective analysis of facility location decisions, European Journal of Operational Research, 49, 295-307.   DOI   ScienceOn
27 Lakshmanan, T. R. and Hansen, W. G., 1965, A retail market potential model, Journal of American Institute of Planners, 31, 134-143.   DOI
28 Lee, G. and O'Kelly, M. E., 2009, Exploring spatial equilibria in a competitive broadband access market: Theoretical modeling approach, Journal of Regional Science, 49(5), 953-975.   DOI   ScienceOn
29 Mu, L., 2004, Polygon characterization with the multiplicatively weighted Voronoi diagram, The Professional Geographer, 56(2), 223-239.
30 Murray, A. T. and Tong, D., 2007, Coverage optimization in continuous space facility siting, International Journal of Geographical Information Science, 21(7), 757-776.   DOI   ScienceOn
31 Newton, H., 2005, Newton's telecom dictionary, CMP Books, San Francisco.
32 Eiselt, H. A. and Laporte, G., 1989, The maximum capture problem in a weighted network, Journal of Regional Science, 29(3), 433-439.   DOI
33 Ghosh, A. and Craig, C. S., 1986, An approach to determining optimal locations for new services, Journal of Marketing Research, 23, 354-362.   DOI   ScienceOn
34 Drezner, T., 1994, Locating a single new facility among existing, unequally attractive facilities, Journal of Regional Science, 34(2), 237-252.   DOI   ScienceOn
35 Drezner, T., 1995, Competitive facility location in the plane, in Drezner, Z.(ed.), Facility location: A survey of applications and methods, Springer, Berlin, 285-300.
36 Drezner, T. and Z. Drezner. 2006, Multiple facilities location in the plane using the gravity model, Geographical Analysis, 38, 391-406.   DOI   ScienceOn
37 Drezner, T., Drezner, Z., and Salhi, S., 2002, Solving the multiple competitive facilities location problem, European Journal of Operational Research, 142, 138-151.   DOI   ScienceOn