Abstract
In this study we investigate the vulnerability of road networks to interdictions. We consider that an intentional attacker wants to maximize the congestion level on the network by interdicting some links of the network. The drivers are assumed to be selfish and always choose the route that minimizes the individual travel cost. In this case, network traffic flow follows user equilibrium (UE) traffic assignment, which however is affected by the interdiction initiated by the attacker. In this problem, the role of the defender is to minimize the damage that can be caused by an attack. A heuristic method is developed to solve for near-optimal attack (interdiction) and defense strategies, the effectiveness of which is demonstrated by simulation results. Numerical experiments are conducted to examine factors that influence the application of this method. Specifically, we compare the efficiency of this method when applied to different Cartesian grid-like networks. Managerial insights into the vulnerability and defense of road networks are drawn from the analysis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Beckmann M, McGuire CB, Winsten CB (1956) Studies in the economics of transportation. Yale University Press, New Haven
Bier VM, Hausken K (2013) Defending and attacking a network of two arcs subject to traffic congestion. Reliab Eng Syst Saf 112:214–224
Bier VM, Gratz ER, Haphuriwat NJ, Magua W, Wierzbicki KR (2007) Methodology for identifying near-optimal interdiction strategies for a power transmission system. Reliab Eng Syst Saf 92(9):1155–1161
Church RL, Scaparra MP (2007) Protecting critical assets: The r-interdiction median problem with fortification. Geog Anal 39(2):129–146
Feng C, Wen C (2003) Traffic control management for earthquake-raided area. J East Asia Soc Transp Stud 5:3261–3275
Florian M, Nguyen S (1976) An application and validation of equilibrium trip assignment methods. Transp Sci 10(4):374–390
Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Res Logistics Q 3(1–2):95–110
Friesz TL (2010) Dynamic optimization and differential games. International series in operations research and management science, vol 135. Springer, New York
Garcia CB, Zangwill WI (1981) Pathways to solutions, fixed points, and equilibria. Prentice-Hall, Michigan
Light Rail Now Project Team (2008) Nearly 3/4 of surface transport terror attacks involve personal motor vehicles—so US security officials focus on … trains? Retrieved 23 July 2014, from http://www.lightrailnow.org/
Murray-Tuite PM, Mahmassani HS (2004) Methodology for determining vulnerable links in a transportation network. Transp Res Rec J Transp Res Board 1882(1):88–96
Ng M, Park J, Waller T (2010) A hybrid bilevel model for the optimal shelter assignment in emergency evacuations. Comput Aided Civ Infrastruct Eng 25:547–556
Pang JS, Chan D (1982) Iterative methods for variational and complementarity problems. Math Program 24(1):284–313
Royset JO, Wood RK (2007) Solving the bi-objective maximum-flow network-interdiction problem. INFORMS J Comput 19(2):175–184
Scarf H (1967) The approximation of fixed points of a continuous mapping. SIAM J Appl Math 15(5):1328–1343
Sheffi Y (1985) Urban transportation networks: equilibrium analysis with mathematical programming methods. Prentice-Hall, Michigan
Todd MJ (1976) The computation of fixed points and applications. In: Lecture notes in economics and mathematical systems, vol 124. Springer, Berlin
Wardrop JG (1952) Some theoretical aspects of road traffic research. ICE Proc Eng Divisions 1(3):325–362
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Gao, M., Zhang, B., Bier, V.M., Yao, T. (2015). A Heuristic Method for Identifying Near-Optimal Defending Strategies for a Road Network Subject to Traffic Congestion. In: Hausken, K., Zhuang, J. (eds) Game Theoretic Analysis of Congestion, Safety and Security. Springer Series in Reliability Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-11674-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-11674-7_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11673-0
Online ISBN: 978-3-319-11674-7
eBook Packages: EngineeringEngineering (R0)