Integrating the maximum capture problem into a GIS framework

This paper presents a methodology for reformulating the maximal capture problem by using the data representation and manipulation capabilities of GIS to define: (1) the coverage region captured by each potential facility, and (2) each unique demand region covered by a specific combination of potential facilities. The formulation is modeled on the maximum covering problem although the integer restriction on the demand capture variables is relaxed. Because demand regions are not exogenously given, areal interpolation is used to estimate the demand associated with each of these regions The model is used to determine the location on a network for a set of home improvement stores that are hypothetically in competition with existing Home Depot stores in Southeastern New Hampshire.

[1]  Robert G. Cromley,et al.  Singly‐ and Doubly‐Constrained Methods of Areal Interpolation for Vector‐based GIS , 1999, Trans. GIS.

[2]  Daniel Serra,et al.  A New Chance-Constrained Maximum Capture Location Problem , 2003 .

[3]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[4]  H. Miller,et al.  Representation and Spatial Analysis in Geographic Information Systems , 2003 .

[5]  Marc P. Armstrong,et al.  Database organization strategies for spatial decision support systems , 1990, Int. J. Geogr. Inf. Sci..

[6]  Avijit Ghosh,et al.  Spatial analysis and location-allocation models , 1987 .

[7]  Dan Yakir,et al.  Global enzymes: Sphere of influence , 2002, Nature.

[8]  Helen Couclelis,et al.  People Manipulate Objects (but Cultivate Fields): Beyond the Raster-Vector Debate in GIS , 1992, Spatio-Temporal Reasoning.

[9]  Charles ReVelle,et al.  Surviving in a Competitive Spatial Market: The Threshold Capture Model , 1999 .

[10]  Gerard Rushton,et al.  Strategies for Solving Large Location-Allocation Problems by Heuristic Methods , 1992 .

[11]  W. Tobler.  Smooth pycnophylactic interpolation for geographical regions. , 1979, Journal of the American Statistical Association.

[12]  Timothy J. Lowe,et al.  Aggregation Error Bounds for a Class of Location Models , 2000, Oper. Res..

[13]  Richard L. Church,et al.  Geographical information systems and location science , 2002, Comput. Oper. Res..

[14]  Marvin White.  A SURVEY OF THE MATHEMATICS OF MAPS , 2008 .

[15]  Vladimir Marianov,et al.  The maximum-capture hierarchical location problem , 1992 .

[16]  Richard L. Francis,et al.  Demand Point Aggregation for Planar Covering Location Models , 2005, Ann. Oper. Res..

[17]  Peter F. Fisher,et al.  Modeling Sensitivity to Accuracy in Classified Imagery: A Study of Areal Interpolation by Dasymetric Mapping* , 1996 .

[18]  E. Hillsman,et al.  Errors in measuring distances from populations to service centers , 1978 .

[19]  Jean-Claude Thill.  Network competition and branch differentiation with consumer heterogeneity , 2000 .

[20]  Tammy Drezner,et al.  Locating a single new facility among existing unequally attractive facilities , 1994 .

[21]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[22]  D. Serra,et al.  Market capture by two competitors: The pre-emptive location problem , 1994 .

[23]  Richard L. Church,et al.  SYMPOSIUM ON LOCATION PROBLEMS: IN MEMORY OF LEON COOPER , 1984 .

[24]  R. Flowerdew,et al.  Using areal interpolation methods in geographic information systems , 1991 .

[25]  L. Cooper.  Location-Allocation Problems , 1963 .

[26]  Harold W. Kulin,et al.  AN EFFICIENT ALGORITHM FOR THE NUMERICAL SOLUTION OF THE GENERALIZED WEBER PROBLEM IN SPATIAL ECONOMICS , 1962 .

[27]  J. Jewkes,et al.  Theory of Location of Industries. , 1933 .

[28]  M. Langford,et al.  Generating and mapping population density surfaces within a geographical information system. , 1994, The Cartographic journal.

[29]  Frank Plastria,et al.  Optimal location and design of a competitive facility , 2004, Math. Program..

[30]  M. Daskin,et al.  Aggregation effects in maximum covering models , 1990 .

[31]  Frank Plastria,et al.  Static competitive facility location: An overview of optimisation approaches , 2001, Eur. J. Oper. Res..

[32]  Michael F. Goodchild,et al.  Areal interpolation: A variant of the traditional spatial problem , 1980 .

[33]  J. Mennis.  Generating Surface Models of Population Using Dasymetric Mapping , 2003, The Professional Geographer.

[34]  Pierre Hansen,et al.  The maximum capture problem with random utilities: Problem formulation and algorithms , 2002, Eur. J. Oper. Res..

[35]  Andrew U. Frank,et al.  Theories and Methods of Spatio-Temporal Reasoning in Geographic Space , 1992, Lecture Notes in Computer Science.

[36]  Charles ReVelle,et al.  THE MAXIMUM CAPTURE OR “SPHERE OF INFLUENCE” LOCATION PROBLEM: HOTELLING REVISITED ON A NETWORK* , 1986 .

[37]  Morton E. O'Kelly,et al.  Recent advances in accessibility research: Representation, methodology and applications , 2003, J. Geogr. Syst..

[38]  H. Hotelling.  Stability in Competition , 1929 .

[39]  Morton E. O'Kelly,et al.  Assessing representation error in point-based coverage modeling , 2002, J. Geogr. Syst..

[40]  Erhan Erkut,et al.  Analysis of aggregation errors for the p-median problem , 1999, Comput. Oper. Res..

[41]  Kathrin Fischer,et al.  Sequential Discrete p-Facility Models for Competitive Location Planning , 2002, Ann. Oper. Res..

[42]  E. Hillsman.  The p-Median Structure as a Unified Linear Model for Location—Allocation Analysis , 1984 .

[43]  Gilbert Laporte,et al.  THE MAXIMUM CAPTURE PROBLEM IN A WEIGHTED NETWORK , 1989 .

[44]  P. Taylor.  Quantitative methods in geography: An introduction to spatial analysis , 1977 .

[45]  N. Lam.  Spatial Interpolation Methods: A Review , 1983 .

[46]  Stefano Benati,et al.  The maximum capture problem with heterogeneous customers , 1999, Comput. Oper. Res..

[47]  Harvey J. Miller,et al.  GIS and Geometric Representation in Facility Location Problems , 1996, Int. J. Geogr. Inf. Sci..