@inproceedings{42228ad7b1614f3e9b043aa81e598611,

title = "On the Optimal Interdiction of Transportation Networks",

abstract = "We consider the optimal interdiction problem in transportation networks as a game in which an attacker acts as the player who goes first and, subject to budget constraints, fails nodes (partially or fully) at time zero so as to maximize the total travel time of the mass. A centralized network operator then acts as the player who goes second and, subject to the system's dynamics, routes the mass so as to minimize its total travel time. We prove that the attacker's best action is to find the most consequential nodes and employ his resources to fail them fully, so that the optimal attack is both sparse and binary. We then propose an algorithm to numerically solve the optimal interdiction problem, and demonstrate the utility of our approach through illustrative examples.",

keywords = "Cascading failures, flow networks, linear programming, network interdiction, optimization, sparsity, traffic networks",

author = "Tianyun Zhang and Makan Fardad",

note = "Funding Information: Financial support from the National Science Foundation under awards CAREER CMMI-1750531 and EAGER ECCS-1545270 is gratefully acknowledged.; 2020 American Control Conference, ACC 2020 ; Conference date: 01-07-2020 Through 03-07-2020",

year = "2020",

month = jul,

doi = "10.23919/ACC45564.2020.9147435",

language = "English (US)",

series = "Proceedings of the American Control Conference",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "4701--4706",

booktitle = "2020 American Control Conference, ACC 2020",

}