4.7 Article

Dynamic Var Reserve-Constrained Coordinated Scheduling of LCC-HVDC Receiving-End System Considering Contingencies and Wind Uncertainties

期刊

IEEE TRANSACTIONS ON SUSTAINABLE ENERGY
卷 12, 期 1, 页码 469-481

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSTE.2020.3006984

关键词

Reactive power; HVDC transmission; Power system dynamics; Circuit faults; Inverters; Dynamic scheduling; HVDC receiving-end power system; dynamic Var reserve; security-constrained robust coordinated scheduling; reduced event-based algorithm; continuous commutation failure; N-1 contingency; wind uncertainty

资金

  1. National Nature Science Foundation of China [51707070, 51707077, TSTE-00230-2020]

向作者/读者索取更多资源

This article proposes a problem formulation and efficient solution algorithm for DVR-constrained coordinated scheduling, considering contingencies and wind uncertainties in HVDC receiving-end power systems. The sufficiency of DVR is emphasized for post-contingency immunity, and a reduced event-based algorithm is developed for efficient calculation and improved computational efficiency. Case studies demonstrate the guaranteed DVR sufficiency, improved economy, and enhanced operational efficiency of the proposed methods.
Sufficient dynamic Var reserve (DVR) can efficiently enhance the immunity against continuous commutation failures (CCF) to avoid DC blocking and further security accidents in the line-commutated converter (LCC) based HVDC receiving-end power system. This article proposes the problem formulation and efficient solution algorithm for the DVR-constrained coordinated scheduling considering contingencies and wind uncertainties. The DVR sufficiency is proposed for the post-contingency CCF immunity in scheduling problems, which combines the voltage sensitivity-based DVR capacity calculation and the off-line DVR requirement tests. HVDC transmission and W/Var sources are coordinately scheduled to accommodate contingencies and wind uncertainties and to improve the operational economy. The reduced event-based algorithm (REA) is developed to subdivide the complex scheduling problem and reduce the considered constraints for efficient calculation. Case studies demonstrate the guaranteed DVR sufficiency, the improved economy, and the enhanced computational efficiency of the proposed methods.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据