Abstract
This paper considers two specific aspects for the problem of protection of regional infrastructure from covert attack. The first aspect considered is the optimal placement of sensors whose goal is to detect vehicles on the transportation network that pose a potential threat to regional infrastructure. These sensors generate both true alarms and false alarms that both need response from an interception team. The second aspect of our problem is related to the sizing of the interception team and on the placement of these resources on the network. A mathematical programming model is developed for the optimal placement of sensors. This model contains a master and a sub-problem; a Bender’s decomposition approach is used for solving the master problem whereas the sub-problem is solved by recognizing that it has the integrality property. For the interception team aspect, a p-median with server unavailability model is developed for determining locations for units, whereas the Hypercube queuing model is used for determining the performance of these units in responding to both true and false alarms generated from sensors. A demonstrative case analysis is offered for the region of Lancaster-Palmdale, CA.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alp O, Erkut E, Drezner Z (2003) An efficient genetic algorithm for the p-Median problem. Ann Oper Res 122:21–42
Awerbuch B, Leighton T (1994) Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks. Annual ACM Symposium on Theory of Computing, Montreal, Quebec, ACM Press, vol. pp. 487–496
Bard J (1998) Practical bilevel optimization: algorithms and applications. Kluwer Academic Publishers, Boston
Bayrak H, Bailey M (2008) Shortest path network interdiction with asymmetric information. Networks 52(3):133–140
Brown G, Carlyle M, Salmeron J, Wood K (2006) Defending critical infrastructure. Interfaces 36(6):530–544
Chelst K (1978) An algorithm for deploying a crime directed (tactical) patrol force. Manage Sci 24(12):1314–1327
Department of Homeland Security (2009) Critical Infrastructure and Key Resources. Retrieved August 20, 2009, from http://www.dhs.gov/files/programs/gc_1189168948944.shtm
Ellefsen R, Liu J (1994) Ubran terrain zone based GIS for MOUT. GIS/LIS '94 Annual Conference and Exposition, Phoenix, AZ, ACSM, vol. 1, pp. 254–262
Goldberg A, Oldham J, Plotkin S, Stein C (1998) An implementation of a combinatorial approximation algorithm for minimum-cost multi-commodity flow. Integer Programming and Combinatorial Optimization. Houston, Texas, Springer Berlin/Heidelberg. 1412/1998: 338
Israeli E, Wood K (2002) Shortest-path network interdiction. Networks 40(2):97–111
Jarvis JP (1985) Approximating the equilibrium behavior of multi-server loss systems. Manage Sci 31(2):235–239
Jenelius E, Petersen T, Mattsson L-G (2006) Importance and exposure in road network vulnerability analysis. Transp Res A 40:537–560
Kara B, Verter V (2004) Designing a road network for hazardous materials transportation. Transp Sci 38(2):188–196
Kleinrock L (1975) Queuing systems. Wiley, New York
Larson R (1975) Approximating the performance of urban emergency service systems. Oper Res 23(5):845–868
Larson R, Franck E (1978) Evaluating dispatching consequences of automatic vehicle locaiton in emergency services. Comput Oper Res 5:11–30
Larson R, Odoni A (2007) Urban operations research. Belmont, Massachusetts, Dynamic Ideas
Leonelli P, Bonvicini S, Spadoni G (2000) Hazardous materials transportation: a risk-analysis-based routing methodology. J Hazard Mater 71:283–300
Lim C, Smith JC (2007) Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Trans 39:15–26
Nemhauser G, Wolsey L (1999) Integer and combinatorial optimization. Wiley-Interscience, New York
Qiao J, Jeong D, Lawley M, Richard J-P, Abraham D, Yih Y (2007) Allocating security resources to a water supply network. IIE Trans 39:95–109
ReVelle CS, Eislet HA (2005) Location analysis: a synthesis and survey. Eur J Oper Res 165:1–19
Schrank D, Lomax T (2005) The 2005 Urban Mobility Report. Texas Transportation Institute, Texas A&M University
Sherali H, Brizendine L, Glickman T, Subramanian S (1997) Low probability—high consequence considerations in routing hazardous material shipments. Transportation Science 31(3)
U.S. Census Bureau (2008) TIGER, TIGER/Line and TIGER-Related Products. Retrieved August 1st, 2008, from http://www.census.gov/geo/www/tiger/
Wein L, Atkinson M (2007) The last line of defense: designing radiation detection-interdiction systems to protect cities from a nuclear terrorist attack. IEEE Transactions on Nuclear Science
Zhang M, Ma Y, Went K (2005) Location-routing model of hazardous materials distribution system based on risk bottleneck. International Conference on Services Systems and Services Management, Proceedings of ICSSSM '05, vol. 1, pp. 362–368
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yates, J., Batta, R. & Karwan, M. Optimal placement of sensors and interception resource assessment for the protection of regional infrastructure from covert attack. J Transp Secur 4, 145–169 (2011). https://doi.org/10.1007/s12198-011-0063-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12198-011-0063-6