An empirical comparison of spatial demand representations in maximal coverage modeling

Spatial demand representation is critical for applying location models to planning processes and the efficiency of modeling solutions. Current research has focused primarily on assessing and mitigating demand representation error but ignored the computational complexity of implementing demand representations and solving the associated models. We first use set theory to formulize Cromley et al's (Institutional Journal of Geographical Information Science 26 495-512) demand representation with the least common demand coverage unit (LCDCU). Then, in the application of using the maximal covering location problem (MCLP) to site base stations optimally for a cellular network, we compare the LCDCU-based representation with widely used point-lattice-based and polygon-lattice-based demand representations in terms of both computational complexity and representation error. The LCDCU-based representation creates demand objects by partitioning a demand space into potential service areas, and has several advantages including offering solutions that provide real 100% demand coverage and eliminating some errors associated with other demand representations. However, the computational complexity of implementing the LCDCU-based representation could easily become extremely high as the number of potential facility sites increases, which could be a challenge to current geographic information systems. In addition, unlike point-based and polygon-based demand representations, the LCDCU-based representations cannot be applied to the planar covering location problems where a facility can be sited anywhere. The results of our study suggest that point-lattice-based demand representations with fine granularity are a good alternative to the LCDCU-based representations due to their effective modeling solutions without extensive computation. Polygon-lattice-based demand representations are not recommended owing to both high computational complexity and relatively large representation error. This study provides some indicators on how to choose an appropriate spatial demand representation in practical applications.

[1]  Alan T. Murray,et al.  Heuristics in Spatial Analysis: A Genetic Algorithm for Coverage Maximization , 2009 .

[2]  Belarmino Adenso-Díaz,et al.  A simple search heuristic for the MCLP: Application to the location of ambulance bases in a rural region , 1997 .

[3]  Z. Drezner,et al.  The p-center location problem in an area , 1996 .

[4]  Kurt Tutschku,et al.  Interference minimization in wireless communication systems by optimal cell site selection , 1999 .

[5]  Eric M. Delmelle,et al.  Base station location and channel allocation in a cellular network with emergency coverage requirements , 2005, Eur. J. Oper. Res..

[6]  Daoqin Tong,et al.  Maximising coverage of spatial demand for service , 2009 .

[7]  A. R. Mahmud,et al.  Maximal service area problem for optimal siting of emergency facilities , 2010, Int. J. Geogr. Inf. Sci..

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

[9]  R. Church,et al.  Selecting sites for rural health workers. , 1982, Social science & medicine.

[10]  Robert G. Cromley,et al.  Using GIS and K = 3 Central Place Lattices for Efficient Solutions to the Location Set‐Covering Problem in a Bounded Plane , 2010, Trans. GIS.

[11]  Lan Mu,et al.  Modular Capacitated Maximal Covering Location Problem for the Optimal Siting of Emergency Vehicles , 2012 .

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

[13]  Richard L. Church,et al.  Reserve selection as a maximal covering location problem , 1996 .

[14]  Stan Openshaw,et al.  Modifiable Areal Unit Problem , 2008, Encyclopedia of GIS.

[15]  Kurt Tutschku,et al.  Demand-based radio network planning of cellular mobile communication systems , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

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

[17]  C. Revelle,et al.  A Lagrangean heuristic for the maximal covering location problem , 1996 .

[18]  Morton E. O'Kelly,et al.  Locating Emergency Warning Sirens , 1992 .

[19]  Daoqin Tong,et al.  Coverage optimization in continuous space facility siting , 2007, Int. J. Geogr. Inf. Sci..

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

[21]  Fangju Wang A parallel intersection algorithm for vector polygon overlay , 1993, IEEE Computer Graphics and Applications.

[22]  Alan T. Murray Geography in Coverage Modeling: Exploiting Spatial Structure to Address Complementary Partial Service of Areas , 2005 .

[23]  Jie Lin,et al.  Evaluating representation and scale error in the maximal covering location problem using GIS and intelligent areal interpolation , 2012, Int. J. Geogr. Inf. Sci..

[24]  Richard L. Church,et al.  Regional service coverage modeling , 2008, Comput. Oper. Res..