Active Security Constraint Identification Based on KKT Condition for Security-Constrained Economic Dispatch
The optimal power flow problem plays an essential role in power system economic dispatch. To conduct daily operation, a huge number of scheduling plans are made in diverse systems. In order to reduce the scale of economic dispatch problems and improve the efficiency of scheduling, an active security constraint identification method is proposed in this paper, which aims to remove adequate useless security constraints to accelerate the calculation of dispatch problem, and keep the optimal solution unchanged. Based on the KKT condition, the proposed model can search for every possible active security constraint, other inactive constraints will be removed for speeding up the solution process. Case studies of an IEEE 30-bus system are demonstrated to show the active constraint identification results. Then, a 57 -bus system and a 118 -bus system are used for presenting the calculation efficiency of the proposed method.
Authors
- Zhi Cai (ORCID: https://orcid.org/0000-0001-6732-6855)
- Mingkai Yu (ORCID: https://orcid.org/0000-0003-1870-0075)
- Dan Xu (ORCID: https://orcid.org/0000-0002-4336-9700)
- Lixin Li (ORCID: https://orcid.org/0000-0002-9980-2649)
- Qiang Ding (ORCID: https://orcid.org/0000-0001-5377-1173)
Institutions
- North China Electric Power University (CN)
- China Electric Power Research Institute
Publication Details
- Published
- 2024-12-13
- DOI
- https://doi.org/10.1109/icpe64565.2024.10929314
- Primary Topic
- Optimal Power Flow Distribution
- Type
- article
- Field-Weighted Citation Impact
- 0.00