Interdicting electrical power grids
Alvarez, Rogelio E.
Wood, R. Kevin
MetadataShow full item record
This thesis explores Benders decomposition for solving interdiction problems on electric power grids, with applications to analyzing the vulnerability of such grids to terrorist attacks. We refine and extend some existing optimization models and algorithms and demonstrate the value of our techniques using standard reliability test networks from IEEE. Our implementation of Benders decomposition optimally solves any problem instance, in theory. However, run times increase as Benders' cuts are added to the master problem, and this has prompted additional research to increase the decomposition's efficiency. We demonstrate empirical speed ups by dropping slack cuts, solving a relaxed master problem in some iterations, and using integer but not necessarily optimal master-problem solutions. These mixed strategies drastically reduce computation times. For example, in one test case, we reduce the optimality gap, and the time that it takes to achieve this gap, from 16% in 75 hours to 5% in 16 minutes.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Agrawal, B.N. (1993);This paper presents a boundary-layer model to predict dynamic characteristics of liquid motion in partially filled tanks of a spinning spacecraft. The solution is obtained by solving three boundary-value problems: an ...
On partitioning an arbitrarily given set of elements of a finite Boolean algebra into the minimum number of sets of compatible elements Colwell, Samuel C., III (Monterey, California. Naval Postgraduate School, 1964);During the past several years at the United States Naval Postgraduate School there has been much interest in obtaining an efficient method for making a time schedule for classes. A mathematical model for a simplified ...
Schwartz, Garry S. (Monterey, California. Naval Postgraduate School, 1993-03);This thesis addresses two problems in aligning the recruiting structure for Navy Recruiting Command. The first problem involves two decisions affecting recruiting stations within a single recruiting district: which stations ...