Using mixed-integer programming to solve power grid blackout problems

被引：66

作者：

Bienstock, Daniel ^{[1
]}

Mattia, Sara

机构：

[1] Columbia Univ, Dept IEOR, New York, NY 10027 USA

[2] Univ Roma La Sapienza, DIS, Rome, Italy

来源：

DISCRETE OPTIMIZATION | 2007年 / 4卷 / 01期

基金：

美国国家科学基金会;

关键词：

power flows; mixed-integer programming; blackouts;

D O I：

10.1016/j.disopt.2006.10.007

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider optimization problems related to the prevention of large-scale cascading blackouts in power transmission networks Subject to multiple scenarios of externally caused damage. We present computation with networks with up to 600 nodes and 827 edges, and many thousands of damage scenarios. (c) 2006 Elsevier B.V. All rights reserved.

引用

页码：115 / 141

页数：27

共 21 条

[1]

AHUJA RK, 1993, NETWORKS FLOWS THEOR

[2]

[Anonymous], OPTIMIZATION ONLINE

[3]

[Anonymous], 1996, Monte Carlo Concepts, Algorithms and Applications

[4]

AVELLLA P, 2004, P 10 INT IPCO C SPRI, P16