Contingency-constrained unit commitment with post-contingency corrective recourse
详细信息 查看全文
- 作者：Richard Li-Yang Chen ; Neng Fan ; Ali Pinar…
- 关键词：Integer programming ; Bi ; level programming ; Benders decomposition ; Unit commitment ; Contingency constraints
- 刊名：Annals of Operations Research
- 出版年：2017
- 出版时间：February 2017
- 年：2017
- 卷：249
- 期：1-2
- 页码：381-407
- 全文大小：
- 刊物类别：Business and Economics
- 刊物主题：Operation Research/Decision Theory; Combinatorics; Theory of Computation;
- 出版者：Springer US
- ISSN：1572-9338
- 卷排序：249
文摘
We consider the problem of minimizing costs in the generation unit commitment problem, a cornerstone in electric power system operations, while enforcing an \(N\)–\(k\)–\(\varvec{\varepsilon }\) reliability criterion. This reliability criterion is a generalization of the well-known \(N\)–\(k\) criterion and dictates that at least \((1-\varepsilon _j)\) fraction of the total system demand (for \(j = 1,\ldots , k\)) must be met following the failure of \(k\) or fewer system components. We refer to this problem as the contingency-constrained unit commitment problem, or CCUC. We present a mixed-integer programming formulation of the CCUC that accounts for both transmission and generation element failures. We propose novel cutting plane algorithms that avoid the need to explicitly consider an exponential number of contingencies. Computational studies are performed on several IEEE test systems and a simplified model of the Western US interconnection network. These studies demonstrate the effectiveness of our proposed methods relative to current state-of-the-art.