首页> 外文会议>IEEE Power & Energy Society General Meeting >Interval arithmetic based optimal curtailment for infeasible SCED considering wind power uncertainties
【24h】

Interval arithmetic based optimal curtailment for infeasible SCED considering wind power uncertainties

机译:考虑风电不确定性的不可行SCED的基于区间算法的最优削减

获取原文

摘要

Security constrained economic dispatch (SCED) is an important tool for ISOs/RTOs to achieve economic power system operation in day-ahead and real-time markets. However, the wind generation uncertainty varying within a large range may make the SCED model unsolvable under certain scenarios. Thus, curtailment is utilized in this work to avoid the infeasibility in the presence of wind power uncertainty. It is found that the uncertainty set is affected by the curtailment restriction which is modeled as an interval number. By the use of interval arithmetic and big M approach, we construct a mixed integer linear programming (MILP) with the objective of minimizing the total curtailment costs, while guaranteeing the SCED to be feasible when wind power varies within its uncertainty set. Numerical results from a 118-bus test system over 24 time periods verify the effectiveness of this proposed method.
机译:安全受限的经济调度(SCED)是ISO / RTO在日前和实时市场中实现经济动力系统运行的重要工具。但是,风力发电的不确定性在较大范围内变化,可能会使SCED模型在某些情况下无法解决。因此,在这项工作中利用削减来避免在存在风力不确定性的情况下的不可行性。发现不确定性集受到缩减限制的影响,缩减限制被建模为间隔数。通过使用区间算术和大M方法,我们构造了一个混合整数线性规划(MILP),目的是最大程度地减少削减成本,同时确保SCED在风能在不确定性范围内变化时是可行的。 118个总线的测试系统在24个时间段内的数值结果证明了该方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号