Defending transportation networks against random and targeted attacks

Transportation Research Record

Volumn , Issue 2234, 2011, Pages 31-40

  Lou, Yingyan ^a   Zhang, Lihui ^b  

^a University of Alabama   (United States)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DISASTERS; INTEGER PROGRAMMING; NETWORK SECURITY; PROBLEM SOLVING;

LARGE-SCALES; NATURAL DISASTERS; NETWORK DEFENSE; NETWORK DESIGN; OPTIMAL RESOURCE ALLOCATION; RANDOM ATTACKS; TERRORIST STRIKES; THREE MODELS; TRANSPORTATION NETWORK; TRAVEL-TIME;

TRAVEL TIME;

EID: 84862933545     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2234-04     Document Type: Article

References (33)

1. The National Strategy for Homeland Security. U.S. Department of Homeland Security, Washington, D.C., 2007. http://www.dhs.gov/xlibrary/assets/nat
2. Balog, J. N., A. Boyd, J. Caton, P. N. Bromley, J. B. Strongin, D. Chia, and K. Bagdonas. TCRP Report 86: Public Transportation Security: Volume 7. Public Transportation Emergency Mobilization and Emergency Operations Guide. Transportation Research Board of the National Academies, Washington, D.C., 2005.
3. Cassir, C., M. G. H. Bell, and Y. Iida. Introduction. In Reliability of Transport Networks (M. G. H. Bell and C. Cassir, eds.), Research Studies Press, Baldock, United Kingdom, 2000, pp. 1-10.
4. Heydecker, B., W. H. K. Lam, and N. Zhang. Use of Travel Demand Satisfaction to Assess Road Network Reliability. Transportmetrica, Vol. 3, No. 2, 2007, pp. 139-171.
5. Yin, Y. Reliability Assessment of Road Networks: Models and Algorithms. PhD dissertation. Department of Civil Engineering, University of Tokyo, 2002.
6. Berdica, K. An Introduction to Road Vulnerability: What Has Been Done, Is Done and Should Be Done. Transport Policy, Vol. 9, No. 2, 2002, pp. 117-127. (Pubitemid 34724802)
7. Chen, A., S. Kongsomsaksakul, Z. Zhou, M. Lee, and W. Recker. Assessing Network Vulnerability of Degradable Transportation Systems: An Accessibility Based Approach. In Transportation and Traffic Theory 2007 (R. E. Allsop, M. G. H. Bell, and B. G. Heydecker, eds.), Elsevier, Oxford, United Kingdom, 2007, pp. 235-262.
8. Jenelius, E., T. Petersen, and L.-G. Mattsson. Importance and exposure in road network vulnerability analysis. Transportation Research Part A, Vol. 40, No. 7, 2006, pp. 537-560.
9. Scott, D. M., D. C. Novak, L. Aultman-Hall, and F. Guo. Network Robustness Index: A New Method for Identifying Critical Links and Evaluating the Performance of Transportation Networks. Journal of Transport Geography, Vol. 14, No. 3, 2006, pp. 215-227.
10. Yin, Y., and H. Ieda. Optimal Improvement Scheme for Network Reliability. In Transportation Research Record: Journal of the Transportation Research Board, No. 1783, Transportation Research Board of the National Academies, Washington, D.C., 2002, pp. 1-6.
11. Chen, A., J. Kim, Z. Zhou, and P. Chootinan. Alpha Reliable Network Design Problem. In Transportation Research Record: Journal of the Transportation Research Board, No. 2029, Transportation Research Board of the National Academies, Washington, D.C., 2007, pp. 49-57. (Pubitemid 351532664)
12. Sumalee, A., D. P. Watling, and S. Nakayama. Reliable Network Design Problem: Case with Uncertain Demand and Total Travel Time Reliability. In Transportation Research Record: Journal of the Transportation Research Board, No. 1964, Transportation Research Board of the National Academies, Washington, D.C., 2006, pp. 81-90. (Pubitemid 46219510)
13. Lo, H. K. and Y. K. Tung. Network with Degradable Links: Capacity Analysis and Design. Transportation Research Part B, Vol. 31, No. 4, 2003, pp. 345-363. (Pubitemid 36122373)
14. Sun, Y. and M. A. Turnquist. Investment in Transportation Network Capacity Under Uncertainty: Simulated Annealing Approach. In Transportation Research Record: Journal of the Transportation Research Board, No. 2039, Transportation Research Board of the National Academies, Washington, D.C., 2007, pp. 67-74. (Pubitemid 351532633)
15. Lou, Y., Y. Yin, and S. Lawphongpanich. Robust Approach to Discrete Network Designs with Demand Uncertainty. In Transportation Research Record: Journal of the Transportation Research Board, No. 2090, Transportation Research Board of the National Academies, Washington, D.C., 2009, pp. 86-94.
16. Smith, J. C., C. Lim, and F. Sudargho. Survivable Network Design Under Optimal and Heuristic Interdiction Scenarios. Journal of Global Optimization, Vol. 38, No. 2, 2007, pp. 181-199. (Pubitemid 46686127)
17. Bell, M. G. H., U. Kanturska, J.-D. Schmocker, and A. Fonzone. Attacker-Defender Models and Road Network Vulnerability. Philosophical Transactions of the Royal Society A: Mathematical, Physical, and Engineering Sciences, Vol. 366, No. 1872, 2008, pp. 1893-1906. (Pubitemid 351585434)
18. Zhang, L., S. Laphongpanich, and Y. Yin. An Active-Set Algorithm for Discrete Network Design Problems. In Transportation and Traffic Theory 2009 (W. H. K. Lam, S. C. Wong. and L. Hong, eds.), Springer, New York, 2009, pp. 283-300.
19. Bell, M. A Game Theory Approach to Measuring the Performance Reliability of Transport Networks. Transportation Research Part B, Vol. 34, No. 6, 2002, pp. 533-545. (Pubitemid 30391132)
20. Szeto, W. Y., L. O'Brien, and M. O'Mahony. Measuring Network Reliability Considering Paradoxes: Multiple Network Demon Approach. In Transportation Research Record: Journal of the Transportation Research Board, No. 2090, Transportation Research Board of the National Academies, Washington, D.C., 2009, pp. 42-50.
21. Szeto, W. Cooperative Game Approaches to Measuring Network Reliability Considering Paradoxes. Transportation Research Part C, Vol. 19, No. 2, 2011, pp. 229-241.
22. Bertismas, D., and M. Sim. Robust Discrete Optimization and Network Flows. Mathematical Programming, Vol. 98, No. 1-3, 2003, pp. 49-71.
23. Polak, E., and J. Royset. On the Use of Augmented Lagrangians in the Solution of Generalized Semi-Infinite Min-Max Problems. Computational Optimization and Applications, Vol. 31, No. 2, 2005, pp. 173-192. (Pubitemid 40878535)
24. LeBlanc, L. J. An Algorithm for the Discrete Network Design Problem. Transportation Science, Vol. 9, No. 3, 1975, pp. 183-199.
25. Poorzahedy, H., and M. A. Turnquist. Approximate Algorithms for the Discrete Network Design Problem. Transportation Research Part B, Vol. 16, No. 1, 1982, pp. 44-55.
26. Lou, Y., Y. Yin, and S. Lawphongpanich. Freeway Service Patrol Deployment Planning for Incident Management and Congestion Mitigation. Transportation Research Part C, Vol. 19, No. 2, 2011, pp. 283-295.
27. Scheel, H., and S. Scholtes. Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity. Mathematics of Operations Research, Vol. 25, No. 1, 2000, pp. 1-22.
28. Wang, D., and H. Lo. Global Optimum of the Linearized Network Design Problem with Equilibrium Flows. Transportation Research Part B, Vol. 44, No. 4, 2010, pp. 482-492.
29. Friesz, T. L., H.-J. Cho, N. J. Metha, R. L. Tobin, and G. Anandalingam. A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints. Transportation Science, Vol. 26, No. 1, 1992, pp. 18-26.
30. Hearn, D. W., and M. V. Ramana. Solving Congestion Toll Pricing Models. In Equilibrium and Advanced Transportation Modeling (P. Marcotte and S. Nguyen, eds.), Kluwer Academic Publishers, Norwell, Mass., 1998, pp. 109-124.
31. LeBlanc, L. J., E. K. Morlok, and W. P. Pierskalla. An Efficient Approach to Solving the Road Network Equilibrium Traffic Assignment Problem, Transport Research, Vol. 9, 1975, pp. 309-318.
32. Brooke, A., D. Kendirck, and A. Meeraus. GAMS: A User's Guide. Scientific Press, San Francisco, Calif., 1992.
33. Drud, A. CONOPT-A Large Scale GRG Code. Operations Research Society of America Journal on Computing, Vol. 6, 1994, pp. 207-216.