期刊
ANNALS OF OPERATIONS RESEARCH
卷 249, 期 1-2, 页码 381-407出版社
SPRINGER
DOI: 10.1007/s10479-014-1760-x
关键词
Integer programming; Bi-level programming; Benders decomposition; Unit commitment; Contingency constraints
资金
- Sandia National Laboratories' Laboratory-Directed Research and Development Program
- U.S. Department of Energy's Office of Science (Advanced Scientific Computing Research program)
- U.S. Department of Energy's National Nuclear Security Administration [DE-AC04-94AL85000]
We consider the problem of minimizing costs in the generation unit commitment problem, a cornerstone in electric power system operations, while enforcing an -- reliability criterion. This reliability criterion is a generalization of the well-known - criterion and dictates that at least fraction of the total system demand (for ) must be met following the failure of 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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据