Transmission Constraint Filtering in Large-Scale Security-Constrained Unit Commitment
When solving the security-constrained unit commitment problem, one of the most complicating factors is handling the large number of transmission constraints, corresponding to both base case and N - 1 line contingency scenarios. Although it is well known that only a few of these constraints need to be enforced, identifying this critical subset of constraints efficiently remains a challenge. In this letter, we propose a novel and simple iterative contingency-screening procedure that is able to eliminate 99.4% of the constraints selected by existing iterative methods, allowing for the solution of much larger-scale problems. We report computational results in realistic instances with up to 6468 buses and 9000 transmission lines. Furthermore, the method was also independently implemented and evaluated at MISO, where it performed faster than alternative methods.
- Research Organization:
- Argonne National Lab. (ANL), Argonne, IL (United States)
- Sponsoring Organization:
- USDOE Office of Electricity Delivery and Energy Reliability (OE), Advanced Grid Research and Development
- Grant/Contract Number:
- AC02-06CH11357
- OSTI ID:
- 1515067
- Journal Information:
- IEEE Transactions on Power Systems, Vol. 34, Issue 3; ISSN 0885-8950
- Publisher:
- IEEECopyright Statement
- Country of Publication:
- United States
- Language:
- English
Web of Science
Similar Records
Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
A Fast Decomposition Method to Solve a Security-Constrained Optimal Power Flow (SCOPF) Problem Through Constraint Handling