Optimal allocation of protective resources in shortest-path networks

Transportation Science

Volumn 45, Issue 1, 2011, Pages 64-80

  Cappanera, Paola ^a   Scaparra, Maria Paola ^b  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITY OF KENT   (United Kingdom)

Author keywords

Multilevel programming; Network interdiction; Resource allocation; Shortest path

Indexed keywords

GAME THEORY; GRAPH THEORY; OPTIMIZATION; RESOURCE ALLOCATION; SENSITIVITY ANALYSIS;

COMPUTATIONAL INVESTIGATION; IMPLICIT ENUMERATION; MULTILEVEL PROGRAMMING; NETWORK INTERDICTION; OPTIMAL ALLOCATION; OPTIMAL PROTECTION; PROBLEM PARAMETERS; SHORTEST PATH;

PROBLEM SOLVING;

EID: 79951870675     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1100.0340     Document Type: Article

References (41)

1. Azaiez, M. N., V. M. Bier. 2007. Optimal resource allocation for security in reliability systems. Eur. J. Oper. Res. 181 773-786. (Pubitemid 46413583)
2. Ball, M. O., B. L. Golden, R. V. Vohra. 1989. Finding the most vital arcs in a network. Oper. Res. Lett. 8 73-76.
3. Bayrak, H., M. Bailey. 2008. Shortest-path network interdiction with asymmetric information. Networks 52(3) 133-140.
4. Bell, M. G. H. 2000. A game theoretic approach to measuring the performance reliability of transport networks. Transportation Res. Part B 34 533-545. (Pubitemid 30391132)
5. Bell, M. G. H., U. Kanturska, J. D. Schmocker, A. Fonzone. 2008. Attacker-defender models and road network vulnerability. Philos. Trans. Roy. Soc. A 366 1893-1906. (Pubitemid 351585434)
6. Bier, V. M., E. R. Gratz, N. J. Haphuriwat, W. Magua, K. Wierzbicki. 2007. Methodology for identifying near-optimal interdiction strategies for a power transmission system. Reliability Engrg. System Safety 92 1155-1161. (Pubitemid 46341792)
7. Brown, G., M. Carlyle, J. Salmeron, K. Wood. 2006. Defending critical infrastructure. Interfaces 36(6) 530-544. (Pubitemid 44905062)
8. Church, R. L., M. P. Scaparra. 2006. Protecting critical assets: The r-interdiction median problem with fortification. Geographical Anal. 39 129-146. (Pubitemid 46431805)
9. Church, R. L., M. P. Scaparra, R. S. Middleton. 2004. Identifying critical infrastructure: The median and covering facility interdiction problems. Ann. Assoc. Amer. Geographers 94(3) 491-502. (Pubitemid 41716604)
10. Corely, H. W., H. Chang. 1974. Finding the most vital nodes in a flow network. Management Sci. 21(3) 362-364.
11. Corely, H. W., D. Y. Sha. 1982. Most vital links and nodes in weighted networks. Oper. Res. Lett. 1(4) 157-160.
12. Cormican, K. J., D. P. Morton, R. K. Wood. 1998. Stochastic network interdiction. Oper. Res. 46(2) 184-197. (Pubitemid 128655394)
13. Dempe, S. 2002. Foundations of Bilevel Programming. Kluwer Academic Publishers, Dordrecht, The Netherlands.
14. Erkut, E., F. Gzara. 2008. Solving the hazmat transport network design problem. Comput. Oper. Res. 35 2234-2247. (Pubitemid 350161136)
15. Fulkerson, D. R., G. C. Harding. 1977. Maximizing the minimum source-sink path subject to a budget constraint. Math. Programming 13 116-118.
16. Golany, B., E. H. Kaplan, A. Marmur, U. G. Rothblum. 2009. Nature plays with dice-Terrorists do not: Allocating resources to counter strategic versus probabilistic risks. Eur. J. Oper. Res. 192 198-208.
17. Golden, B. 1978. A problem of network interdiction. Naval Res. Logist. Quart. 25 711-713.
18. Hausken, K. 2008. Strategic defense and attack for series and parallel reliability systems. Eur. J. Oper. Res. 186 856-881. (Pubitemid 47615325)
19. Held, H., R. Hemmecke, D. L. Woodruff. 2005. A decomposition algorithm applied to planning the interdiction of stochastic networks. Naval Res. Logist. 52 321-328. (Pubitemid 40666210)
20. Hemmecke, R., R. Schultz, D. L. Woodruff. 2003. Interdicting stochastic networks with binary interdiction effort. D. L. Woodruff, ed. Network Interdiction and Stochastic Integer Programming. Kluwer, Boston, 69-84.
21. Holmgren, A. J., E. Jenelius, J. Westin. 2007. Evaluating strategies for defending electric power networks against antagonistic attacks. IEEE Trans. Power Systems 22(1) 76-84. (Pubitemid 46442139)
22. Israeli, E., R. K. Wood. 2002. Shortest-path network interdiction. Networks 40(2) 97-111. (Pubitemid 37218345)
23. Jenelius, E., T. Peterson, L. G. Mattsson. 2006. Importance and exposure in road network vulnerability analysis. Transportation Res. Part A 40 537-560.
24. Kara, B. Y., V. Verter. 2004. Designing a road network for hazardous materials transportation. Transportation Sci. 38 188-196.
25. Labbé, M., P. Marcotte, G. Savard. 1998. A bilevel model of taxation and its application to optimal highway pricing. Management Sci. 44(12) 1608-1622. (Pubitemid 128617774)
26. Liberatore, F., M. P. Scaparra, M. Daskin. 2011. Analysis of facility protection strategies against an uncertain number of attacks: The stochastic R-interdiction median problem with fortification. Comput. Oper. Res. 38 351-366.
27. Lim, C., J. C. Smith. 2007. Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Trans. 39(1) 15-26. (Pubitemid 44688388)
28. Malik, K., A. K. Mittal, S. K. Gupta. 1989. The k most vital arcs in the shortest path problem. Oper. Res. Lett. 8 223-227.
29. Martins, E. Q. V., J. L. E. Santos. 2000. A new shortest path ranking algorithm. Investigação Oper. 20(1) 47-62.
30. Michaud, D. E., G. E. Apostolakis. 2006. A methodology for ranking the elements of water-supply networks. J. Infrastructure Systems 12 230-242. (Pubitemid 44768337)
31. Moore, J. T., J. F. Bard. 1990. The mixed-integer linear bilevel programming problem. Oper. Res. 38 911-921.
32. Qiao, J., D. Jeong, M. Lawley, J. P. Richard, D. M. Abraham, Y. Yih. 2007. Allocating security resources to a water supply network. IIE Trans. 39 95-109. (Pubitemid 44688394)
33. Salmeron, J., R. K. Wood, R. Baldick. 2004. Analysis of electric grid security under terrorist threat. IEEE Trans. Power Systems 19(2) 905-912.
34. Salmeron, J., K. Wood, R. Baldick. 2009. Worst-case interdiction analysis of large-scale electric power grids. IEEE Trans. Power Systems 24 96-104.
35. Scaparra, M. P., R. L. Church. 2008a. A bilevel mixed integer program for critical infrastructure protection planning. Comput. Oper. Res. 35 1905-1923. (Pubitemid 47615235)
36. Scaparra, M. P., R. L. Church. 2008b. An exact solution approach for the interdiction median problem with fortification. Eur. J. Oper. Res. 189 76-92. (Pubitemid 351232143)
37. Scott, D. M., D. C. Novak, L. Aultman-Hall, F. Guo. 2006. Network robustness index: A new method for identifying critical links and evaluating the performance of transportation networks. J. Transport Geography 14 215-227.
38. Smith, J. C., C. Lim, F. Sudargho. 2007. Survivable network design under optimal and heuristic interdiction scenarios. J. Global Optim. 38 181-199. (Pubitemid 46686127)
39. Sternberg, E., G. Lee. 2006. Meeting the challenge of facility protection for homeland security. J. Homeland Security Emergency Management 3(1) 1-19.
40. Wollmer, R. 1964. Removing arcs from a network. Oper. Res. 12(6) 934-940.
41. Zhuang, J., V. M. Bier. 2007. Balancing terrorism and natural disasters-Defensive strategy with endogenous attacker effort. Oper. Res. 55(5) 976-991. (Pubitemid 351159542)