首页> 外文OA文献 >Heterogeneous Unit Clustering for Efficient Operational Flexibility Modeling for Strategic Models
【2h】

Heterogeneous Unit Clustering for Efficient Operational Flexibility Modeling for Strategic Models

机译:异构单元聚类用于战略模型的高效操作灵活性建模

摘要

The increasing penetration of wind generation has led to significant improvements in unit commitment models. However, long-term capacity planning methods have not been similarly modified to address the challenges of a system with a large fraction of generation from variable sources. Designing future capacity mixes with adequate flexibility requires an embedded approximation of the unit commitment problem to capture operating constraints. Here we propose a method, based on clustering units, for a simplified unit commitment model with dramatic improvements in solution time that enable its use as a submodel within a capacity expansion framework. Heterogeneous clustering speeds computation by aggregating similar but non-identical units thereby replacing large numbers of binary commitment variables with fewer integers that still capture individual unit decisions and constraints. We demonstrate the trade-off between accuracy and run-time for different levels of aggregation. A numeric example using an ERCOT-based 205-unit system illustrates that careful aggregation introduces errors of 0.05-0.9% across several metrics while providing several orders of magnitude faster solution times (400x) compared to traditional binary formulations and further aggregation increases errors slightly (~2x) with further speedup (2000x). We also compare other simplifications that can provide an additional order of magnitude speed-up for some problems.
机译:风力发电的渗透率不断提高,已大大改善了机组承诺模型。但是,长期容量规划方法尚未进行类似的修改,以解决具有很大一部分来自可变源的发电系统的挑战。要设计具有足够灵活性的未来容量组合,就需要对单元承诺问题进行嵌入式近似,以捕获操作约束。在这里,我们提出了一种基于聚类单元的方法,用于简化的单元承诺模型,并大大缩短了解决时间,使其能够在容量扩展框架内用作子模型。异类聚类通过聚集相似但不相同的单元来加快计算速度,从而用较少的整数替换大量的二进制承诺变量,这些整数仍捕获单个单元的决策和约束。我们展示了不同聚合级别在准确性和运行时间之间的权衡。使用基于ERCOT的205个单元的系统的数值示例说明,与传统的二元配方相比,仔细的汇总会在多个指标上引入0.05-0.9%的误差,同时提供比传统二元公式化快几个数量级的求解时间(400x),进一步的汇总会稍微增加误差约2倍),并进一步加速(2000倍)。我们还比较了其他简化方案,它们可以为某些问题提供额外的数量级加速。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号