Identifying critical infrastructure: The median and covering facility interdiction problems

被引:265
作者
Church, RL [1 ]
Scaparra, MP [1 ]
Middleton, RS [1 ]
机构
[1] Univ Calif Santa Barbara, Dept Geog, Santa Barbara, CA 93106 USA
关键词
critical infrastructure; facility location; p-median problem; maximal covering; interdiction;
D O I
10.1111/j.1467-8306.2004.00410.x
中图分类号
P9 [自然地理学]; K9 [地理];
学科分类号
0705 ; 070501 ;
摘要
Facilities and their services can be lost due to natural disasters as well as to intentional strikes, either by terrorism or an army. An intentional strike against a system is called interdiction. The geographical distribution of facilities in a supply or service system may be particularly vulnerable to interdiction, and the resulting impacts of the loss of one or more facilities may be substantial. Critical infrastructure can be defined as those elements of infrastructure that, if lost, could pose a significant threat to needed supplies (e.g., food, energy, medicines), services (e.g., police, fire, and EMS), and communication or a significant loss of service coverage or efficiency. In this article we introduce two new spatial optimization models called the r-interdiction median problem and the r-interdiction covering problem. Both models identify for a given service/supply system, that set of facilities that, if lost, would affect service delivery the most, depending upon the type of service protocol. These models can then be used to identify the most critical facility assets in a service/supply system. Results of both models applied to spatial data are also presented. Several solutions derived from these two interdiction models are presented in greater detail and demonstrate the degree to which the loss of one or more facilities disrupts system efficiencies or coverage. Recommendations for further research are also made.
引用
收藏
页码:491 / 502
页数:12
相关论文
共 39 条
[1]   FINDING THE MOST VITAL ARCS IN A NETWORK [J].
BALL, MO ;
GOLDEN, BL ;
VOHRA, RV .
OPERATIONS RESEARCH LETTERS, 1989, 8 (02) :73-76
[2]  
Burch C., 2003, NETWORK INTERDICTION, P51
[3]  
Church R., 1974, PAPERS REGIONAL SCI, V32, P101, DOI [DOI 10.1007/BF01942293, DOI 10.1111/J.1435-5597.1974.TB00902.X]
[4]  
Corley H. W., 1982, Operations Research Letters, V1, P157, DOI 10.1016/0167-6377(82)90020-7
[5]   FINDING N MOST VITAL NODES IN A FLOW NETWORK [J].
CORLEY, HW ;
CHANG, H .
MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 21 (03) :362-364
[6]   Stochastic network interdiction [J].
Cormican, KJ ;
Morton, DP ;
Wood, RK .
OPERATIONS RESEARCH, 1998, 46 (02) :184-197
[7]  
CUTTER SL, 2003, GEOGRAPHICAL DIMENSI, P223
[8]   DETERMINING EMERGENCY MEDICAL-SERVICE VEHICLE DEPLOYMENT IN AUSTIN, TEXAS [J].
EATON, DJ ;
DASKIN, MS ;
SIMMONS, D ;
BULLOCH, B ;
JANSMA, G .
INTERFACES, 1985, 15 (01) :96-108
[9]  
Fourer R, 1993, AMPL MODELING LANGUA
[10]   MAXIMIZING MINIMUM SOURCE-SINK PATH SUBJECT TO A BUDGET CONSTRAINT [J].
FULKERSON, DR ;
HARDING, GC .
MATHEMATICAL PROGRAMMING, 1977, 13 (01) :116-118