TY - JOUR
T1 - Contingency-constrained unit commitment with post-contingency corrective recourse
AU - Chen, Richard Li Yang
AU - Fan, Neng
AU - Pinar, Ali
AU - Watson, Jean Paul
N1 - Funding Information:
Sandia National Laboratories’ Laboratory-Directed Research and Development Program and the U.S. Department of Energy’s Office of Science (Advanced Scientific Computing Research program) funded portions of this work. Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000.
Publisher Copyright:
© 2014, Springer Science+Business Media New York.
PY - 2017/2/1
Y1 - 2017/2/1
N2 - 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–ε reliability criterion. This reliability criterion is a generalization of the well-known N–k criterion and dictates that at least (1 - εj) fraction of the total system demand (for j= 1 , … , 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.
AB - 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–ε reliability criterion. This reliability criterion is a generalization of the well-known N–k criterion and dictates that at least (1 - εj) fraction of the total system demand (for j= 1 , … , 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.
KW - Benders decomposition
KW - Bi-level programming
KW - Contingency constraints
KW - Integer programming
KW - Unit commitment
UR - http://www.scopus.com/inward/record.url?scp=84916897651&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84916897651&partnerID=8YFLogxK
U2 - 10.1007/s10479-014-1760-x
DO - 10.1007/s10479-014-1760-x
M3 - Article
AN - SCOPUS:84916897651
VL - 249
SP - 381
EP - 407
JO - Annals of Operations Research
JF - Annals of Operations Research
SN - 0254-5330
IS - 1-2
ER -