期刊
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS
卷 134, 期 -, 页码 -出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.ijepes.2021.107364
关键词
Conic relaxation; Convex programming; Unit commitment
资金
- U.S. Department of Energy Advanced Grid Modeling Program [DE-OE0000875]
An effective three-step solution approach is proposed to address the AC network-constrained unit commitment problem, including DC approximation, second-order conic relaxation, and continuous convex optimization to ensure full AC feasibility, which is validated using test systems with multiple generators and transmission lines.
To address the AC network-constrained unit commitment problem, we propose an effective three-step solution approach. We first solve a DC (mixed-integer linear) approximation of the original problem to identify an initial solution and the set of transmission lines likely to be congested. Secondly, with the linear solution as a starting point, we solve a mixed-integer second-order conic relaxation of the original problem using an active set strategy regarding transmission constraints. Finally, using the solution of the relaxed problem as a starting point, we solve a set of increasingly accurate continuous convex optimization problems to ensure full AC feasibility. We show the effectiveness of the proposed approach using the IEEE 24-bus test system and an Illinois 200-bus system with 49 generators and 245 lines.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据