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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Active Security Constraint Identification Based on KKT Condition for Security-Constrained Economic Dispatch

Zhi Cai, Mingkai Yu, Dan Xu, Lixin Li et al.
Optimal Power Flow Distribution
article

Active Security Constraint Identification Based on KKT Condition for Security-Constrained Economic Dispatch

Zhi Cai, Mingkai Yu, Dan Xu, Lixin Li, Qiang Ding
article en

Abstract

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.

North China Electric Power University (CN), China Electric Power Research Institute
Reduced inequalities
Openalex Percentile: Top 73%
Optimal Power Flow Distribution
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.