期刊
IEEE TRANSACTIONS ON POWER SYSTEMS
卷 30, 期 4, 页码 1947-1956出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2014.2357713
关键词
Decomposition algorithm; l(1) regularization; security-constrained optimal power flow
资金
- National Science Foundation [CCF1331426]
This paper proposes a new formulation for the corrective security-constrained optimal power flow (SCOPF) problem with DC power flow constraints. The goal is to produce a generation schedule which has a minimal number of post-contingency corrections as well as a minimal amount of total MW rescheduled. In other words, the new SCOPF model effectively clears contingencies with corrective actions that have a minimal impact on system operations. The proposed SCOPF model utilizes sparse optimization techniques to achieve computational tractability for large-scale power systems. We also propose two efficient decomposition algorithms. Extensive computational experiments show the advantage of the proposed model and algorithms on several standard IEEE test systems and large-scale real-world power systems.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据