Geography in coverage modeling: Exploiting spatial structure to address complementary partial service of areas

被引:69
作者
Murray, AT [1 ]
机构
[1] Ohio State Univ, Dept Geog, Columbus, OH 43210 USA
关键词
facility location; set covering; representation; spatial analysis;
D O I
10.1111/j.1467-8306.2005.00485.x
中图分类号
P9 [自然地理学]; K9 [地理];
学科分类号
0705 ; 070501 ;
摘要
The assessment of, and planning for, service coverage has been a fundamental aspect of geographic research. In particular, facility placement and associated coverage are central concerns in emergency services, transit route design, cartographic simplification, natural resource management, and weather monitoring, among others. In this article the widely applied set-covering problem is discussed, focusing on its use in geographic analysis. Problematic aspects of set-coverage modeling across space are identified. In particular, geographic information systems (GIS) and enhanced spatial information have accentuated abstraction/spatial representation issues in need of greater consideration in modeling service coverage. To address representational problems with existing approaches, a new set-covering model is introduced for dealing with spatial objects (points, lines, polygons, arcs, curves, etc.). The developed approach accounts for complementary coverage of objects. In doing this, the model decreases modifiable areal unit problem impacts known to be an issue in the geographic application of the set-covering problem. Empirical results are presented to support the usefulness and validity of this new approach.
引用
收藏
页码:761 / 772
页数:12
相关论文
共 36 条
[1]  
ALY AA, 1978, J OPER RES SOC, V29, P1167, DOI 10.2307/3009582
[2]   Species distributions, land values, and efficient conservation [J].
Ando, A ;
Camm, J ;
Polasky, S ;
Solow, A .
SCIENCE, 1998, 279 (5359) :2126-2128
[3]   SET-COVERING PROBLEM [J].
BALAS, E ;
PADBERG, MW .
OPERATIONS RESEARCH, 1972, 20 (06) :1152-1161
[4]  
BEASLEY JE, 1990, NAV RES LOG, V37, P151, DOI 10.1002/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO
[5]  
2-2
[6]  
BENVENISTE R, 1982, J OPER RES SOC, V33, P261, DOI 10.2307/2581491
[7]   Fast heuristics for large scale covering-location problems [J].
Brotcorne, L ;
Laporte, G ;
Semet, F .
COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (06) :651-665
[8]   Algorithms for the set covering problem [J].
Caprara, A ;
Toth, P ;
Fischetti, M .
ANNALS OF OPERATIONS RESEARCH, 2000, 98 (1-4) :353-371
[9]  
Ceria S., 1997, Annotated bibliographies in combinatorial optimization, P415
[10]  
Christaller W, 1966, CENTRAL PLACES SO GE