.png){kind=icon}
返回
An objective feasibility pump method for optimal power flow with unit commitment variables
.png){kind=icon}
PRE
AI
DOI：10.1016/j.epsr.2024.110928.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Unexpected and significant power fluctuations caused by severe faults or rapid changes in renewable energy generation could lead to the divergence of the security constraint economic dispatch (SCED), which is often based on the AC optimal power flow (ACOPF) model. To obtain a feasible solution for SCED, the ACOPF model with unit commitment (UC) variables (ACOPF-UCV) is leveraged to reschedule the UC, yielding a mixed integer nonlinear programming (MINLP) problem. To solve this problem quickly, this paper proposes an objective feasibility pump (FP) method. In this method, the MINLP problem is relaxed to an NLP problem to generate two sequences of fractional and integral solutions that gradually converge during the iterations. Simulations on the IEEE 300-bus system, the IEEE 118-bus system, the Polish 2383-bus system, and a practical 13977-bus system show that the proposed method can obtain quite good solutions in a very short time.
Keyword:
Objective feasibility pump (FP)
Unit commitment (UC)
Mixed integer nonlinear programming (MINLP)
AC optimal power flow (ACOPF)
Security constraint economic dispatch (SCED)
期刊
IF:
4.2
论文数:
1.2W
被引数:
2.2W
机构
引用论文
A decomposition method for network-constrained unit commitment with AC power flow constraints.png)
ENERGY
ENERGYIF9.4
PREAI
分享收藏
查看更多内容