메뉴 건너뛰기




Volumn , Issue 2234, 2011, Pages 31-40

Defending transportation networks against random and targeted attacks

Author keywords

[No Author keywords available]

Indexed keywords

DISASTERS; INTEGER PROGRAMMING; NETWORK SECURITY; PROBLEM SOLVING;

EID: 84862933545     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2234-04     Document Type: Article
Times cited : (46)

References (33)
  • 1
    • 58849084450 scopus 로고    scopus 로고
    • U.S. Department of Homeland Security, Washington, D.C. Accessed Oct. 2010
    • The National Strategy for Homeland Security. U.S. Department of Homeland Security, Washington, D.C., 2007. http://www.dhs.gov/xlibrary/assets/nat
    • (2007) The National Strategy for Homeland Security
  • 3
    • 0012580048 scopus 로고    scopus 로고
    • Introduction
    • M. G. H. Bell and C. Cassir, eds Research Studies Press, Baldock, United Kingdom
    • 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.
    • (2000) Reliability of Transport Networks , pp. 1-10
    • Cassir, C.1    Bell, M.G.H.2    Iida, Y.3
  • 4
    • 45749120504 scopus 로고    scopus 로고
    • Use of travel demand satisfaction to assess road network reliability
    • 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.
    • (2007) Transportmetrica , vol.3 , Issue.2 , pp. 139-171
    • Heydecker, B.1    Lam, W.H.K.2    Zhang, N.3
  • 6
    • 0036302691 scopus 로고    scopus 로고
    • An introduction to road vulnerability: What has been done, is done and should be done
    • DOI 10.1016/S0967-070X(02)00011-2, PII S0967070X02000112
    • 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)
    • (2002) Transport Policy , vol.9 , Issue.2 , pp. 117-127
    • Berdica, K.1
  • 7
    • 80052978116 scopus 로고    scopus 로고
    • Assessing network vulnerability of degradable transportation systems: An accessibility based approach
    • (R. E. Allsop, M. G. H. Bell, and B. G. Heydecker, eds.), Elsevier, Oxford, United Kingdom
    • 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.
    • (2007) Transportation and Traffic Theory 2007 , pp. 235-262
    • Chen, A.1    Kongsomsaksakul, S.2    Zhou, Z.3    Lee, M.4    Recker, W.5
  • 8
    • 33645902544 scopus 로고    scopus 로고
    • Importance and exposure in road network vulnerability analysis
    • 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.
    • (2006) Transportation Research Part A , vol.40 , Issue.7 , pp. 537-560
    • Jenelius, E.1    Petersen, T.2    Mattsson -. L, G.3
  • 9
    • 33646550868 scopus 로고    scopus 로고
    • Network robustness index: A new method for identifying critical links and evaluating the performance of transportation networks
    • 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.
    • (2006) Journal of Transport Geography , vol.14 , Issue.3 , pp. 215-227
    • Scott, D.M.1    Novak, D.C.2    Aultman-Hall, L.3    Guo, F.4
  • 10
    • 0036958056 scopus 로고    scopus 로고
    • Optimal Improvement Scheme for Network Reliability
    • Transportation Research Board of the National Academies, Washington, D.C.
    • 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.
    • (2002) Transportation Research Record: Journal of the Transportation Research Board, No. 1783 , pp. 1-6
    • Yin, Y.1    Ieda, H.2
  • 11
    • 42149109755 scopus 로고    scopus 로고
    • Alpha reliable network design problem
    • DOI 10.3141/2029-06, Network Equilibrium Modeling 2007
    • 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)
    • (2007) Transportation Research Record , Issue.2029 , pp. 49-57
    • Chen, A.1    Kim, J.2    Zhou, Z.3    Chootinan, P.4
  • 12
    • 33748129322 scopus 로고    scopus 로고
    • Reliable network design problem: Case with uncertain demand and total travel time reliability
    • Network Modeling 2006
    • 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)
    • (2006) Transportation Research Record , Issue.1964 , pp. 81-90
    • Sumalee, A.1    Watling, D.P.2    Nakayama, S.3
  • 13
    • 0037401572 scopus 로고    scopus 로고
    • Network with degradable links: Capacity analysis and design
    • DOI 10.1016/S0191-2615(02)00017-6, PII S0191261502000176
    • 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)
    • (2003) Transportation Research Part B: Methodological , vol.37 , Issue.4 , pp. 345-363
    • Lo, H.K.1    Tung, Y.-K.2
  • 14
    • 42149182946 scopus 로고    scopus 로고
    • Investment in transportation network capacity under uncertainty simulated annealing approach
    • DOI 10.3141/2039-08, Network Modeling 2007
    • 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)
    • (2007) Transportation Research Record , Issue.2039 , pp. 67-74
    • Sun, Y.1    Turnquist, M.A.2
  • 16
    • 34247625594 scopus 로고    scopus 로고
    • Survivable network design under optimal and heuristic interdiction scenarios
    • DOI 10.1007/s10898-006-9067-3, Special Issue Go05, Proceedings from the Workshop on Global Optimization, San Jose, Almeria, Spain, 18-22 September 2005
    • 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)
    • (2007) Journal of Global Optimization , vol.38 , Issue.2 , pp. 181-199
    • Smith, J.C.1    Lim, C.2    Sudargho, F.3
  • 18
    • 80053319960 scopus 로고    scopus 로고
    • An Active-Set Algorithm for Discrete Network Design Problems
    • (W. H. K. Lam, S. C. Wong. and L. Hong, eds.), Springer, New York
    • 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.
    • (2009) Transportation and Traffic Theory 2009 , pp. 283-300
    • Zhang, L.1    Laphongpanich, S.2    Yin, Y.3
  • 19
    • 0034043026 scopus 로고    scopus 로고
    • A game theory approach to measuring the performance reliability of transport networks
    • DOI 10.1016/S0191-2615(99)00042-9, PII S0191261599000429
    • 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)
    • (2000) Transportation Research Part B: Methodological , vol.34 , Issue.6 , pp. 533-545
    • Bell, M.G.H.1
  • 20
    • 76149091846 scopus 로고    scopus 로고
    • Measuring Network Reliability Considering Paradoxes: Multiple network demon approach
    • Transportation Research Board of the National Academies Washington, D.C.
    • 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.
    • (2009) Transportation Research Record: Journal of the Transportation Research Board, No. 2090 , pp. 42-50
    • Szeto, W.Y.1    O'Brien, L.2    O'Mahony, M.3
  • 21
    • 78951469101 scopus 로고    scopus 로고
    • Cooperative game approaches to measuring network reliability considering paradoxes
    • Szeto, W. Cooperative Game Approaches to Measuring Network Reliability Considering Paradoxes. Transportation Research Part C, Vol. 19, No. 2, 2011, pp. 229-241.
    • (2011) Transportation Research Part C , vol.19 , Issue.2 , pp. 229-241
    • Szeto, W.1
  • 22
    • 84870613023 scopus 로고    scopus 로고
    • Robust discrete optimization and network flows
    • Bertismas, D., and M. Sim. Robust Discrete Optimization and Network Flows. Mathematical Programming, Vol. 98, No. 1-3, 2003, pp. 49-71.
    • (2003) Mathematical Programming , vol.98 , Issue.1-3 , pp. 49-71
    • Bertismas, D.1    Sim, M.2
  • 23
    • 21144454232 scopus 로고    scopus 로고
    • On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
    • DOI 10.1007/s10589-005-2179-8
    • 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)
    • (2005) Computational Optimization and Applications , vol.31 , Issue.2 , pp. 173-192
    • Polak, E.1    Royset, J.O.2
  • 24
    • 0016539223 scopus 로고
    • An algorithm for the discrete network design problem
    • LeBlanc, L. J. An Algorithm for the Discrete Network Design Problem. Transportation Science, Vol. 9, No. 3, 1975, pp. 183-199.
    • (1975) Transportation Science. , vol.9 , Issue.3 , pp. 183-199
    • Leblanc, L.J.1
  • 25
    • 0019897635 scopus 로고
    • Approximate algorithms for the discrete network design problem
    • 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.
    • (1982) Transportation Research Part B , vol.16 , Issue.1 , pp. 44-55
    • Poorzahedy, H.1    Turnquist, M.2
  • 26
    • 78951489751 scopus 로고    scopus 로고
    • Freeway service patrol deployment planning for incident management and congestion mitigation
    • 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.
    • (2011) Transportation Research Part C , vol.19 , Issue.2 , pp. 283-295
    • Lou, Y.1    Yin, Y.2    Lawphongpanich, S.3
  • 27
    • 0034139059 scopus 로고    scopus 로고
    • Mathematical programs with complementarity constraints: Stationarity, optimality, and sensitivity
    • 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.
    • (2000) Mathematics of Operations Research , vol.25 , Issue.1 , pp. 1-22
    • Scheel, H.1    Scholtes, S.2
  • 28
    • 77549087181 scopus 로고    scopus 로고
    • Global optimum of the linearized network design problem with equilibrium flows
    • 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.
    • (2010) Transportation Research Part B , vol.44 , Issue.4 , pp. 482-492
    • Wang, D.1    Lo, H.2
  • 29
    • 0026820330 scopus 로고
    • A simulated annealing approach to the network design problem with variational inequality constraints
    • 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.
    • (1992) Transportation Science , vol.26 , Issue.1 , pp. 18-26
    • Friesz, T.L.1    Cho -. H, J.2    Metha, N.J.3    Tobin, R.L.4    Anandalingam, G.5
  • 30
    • 0002837748 scopus 로고    scopus 로고
    • Solving congestion toll pricing models
    • P. Marcotte and S. Nguyen, eds.), Kluwer Academic Publishers, Norwell, Mass.
    • 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.
    • (1998) Equilibrium and Advanced Transportation Modeling , pp. 109-124
    • Hearn, D.W.1    Ramana, M.V.2
  • 31
    • 0016565756 scopus 로고
    • An efficient approach to solving the road network equilibrium traffic assignment problem
    • 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.
    • (1975) Transport Research , vol.9 , pp. 309-318
    • Leblanc, L.J.1    Morlok, E.K.2    Pierskalla, W.P.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.