Attacker-defender models and road network vulnerability. (English) Zbl 1153.90002

Summary: The reliability of road networks depends directly on their vulnerability to disruptive incidents, ranging in severity from minor disruptions to terrorist attacks. This paper presents a game theoretic approach to the analysis of road network vulnerability. The approach posits predefined disruption, attack or failure scenarios and then considers how to use the road network so as to minimize the maximum expected loss in the event of one of these scenarios coming to fruition. A mixed route strategy is adopted, meaning that the use of the road network is determined by the worst scenario probabilities. This is equivalent to risk-averse route choice. A solution algorithm suitable for use with standard traffic assignment software is presented, thereby enabling the use of electronic road navigation networks. A variant of this algorithm suitable for risk-averse assignment is developed. A numerical example relating to the central London road network is presented. The results highlight points of vulnerability in the road network. Applications of this form of network vulnerability analysis together with improved solution methods are discussed.


90B20 Traffic problems in operations research
91A43 Games involving graphs
Full Text: DOI


[1] Albert, Nature; Physical Science (London) 406 (6794) pp 378– (2000)
[2] 367 pp 553– (2006)
[3] J ADV TRANSPORT 33 pp 135– (1999)
[4] TRANSPORT RES B 34 pp 533– (2000)
[5] IEEE TRANS RELIAB 52 pp 63– (2003)
[6] J URBAN PLAN DEV 130 pp 37– (2004)
[7] NETW SPAT ECON 6 pp 253– (2006)
[8] TRANSPORT RES B 36 pp 671– (2002)
[9] TRANSP POL 9 pp 117– (2002)
[10] Brown, Interfaces 36 (6) pp 530– (2006)
[11] OPERAT RES 46 pp 184– (1998)
[12] 33 pp 481– (2006)
[13] NETWORKS 40 pp 97– (2002)
[14] TRANSPORT RES B 40 pp 537– (2006)
[15] Royset, INFORMS Journal on Computing 19 (2) pp 175– (2007) · Zbl 1241.90139
[16] J TRANSP GEOGR 14 pp 215– (2006)
[17] OPERAT RES 43 pp 243– (1995)
[18] 17 pp 1– (1993)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.