Abstract
Security constraints are necessary in unit commitment problems to guarantee reliable commitments. However, only a small subset of security constraints can bind in the unit commitment problem. This paper presents a data-aided prescreening approach that could identify and remove non-dominating security constraints. This approach takes advantage of both deterministic and statistical methods, which leverages the historical data and linear programming (LP) solution. Lazy constraints are used in optimization solver to maintain solution integrity. Case studies presented here use Midcontinent Independent System Operator (MISO) data, and simulation results show that the proposed prescreening approach significantly improves computational performance.
| Original language | English |
|---|---|
| Title of host publication | 51st North American Power Symposium, NAPS 2019 |
| Place of Publication | usa |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| ISBN (Electronic) | 9781728104072 |
| DOIs | |
| State | Published - Oct 1 2019 |
| Event | 51st North American Power Symposium, NAPS 2019 - Wichita, United States Duration: Oct 13 2019 → Oct 15 2019 |
Conference
| Conference | 51st North American Power Symposium, NAPS 2019 |
|---|---|
| Country/Territory | United States |
| City | Wichita |
| Period | 10/13/19 → 10/15/19 |
Keywords
- Lazy Constraint
- Optimal Power Flow
- Security Constraint
- Transmission Congestion
- Unit Commitment
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver