首页> 外文期刊>Energy >k-MILP: A novel clustering approach to select typical and extreme days for multi-energy systems design optimization
【24h】

k-MILP: A novel clustering approach to select typical and extreme days for multi-energy systems design optimization

机译:K-MILP:一种新的聚类方法,可为多能量系统设计优化选择典型和极端天

获取原文
获取原文并翻译 | 示例
           

摘要

When optimizing the design of multi-energy systems, the operation strategy and the part-load behavior of the units must be considered in the optimization model, which therefore must be formulated as a two-stage problem. In order to guarantee computational tractability, the operation problem is solved for a limited set of typical and extreme periods. The selection of these periods is an important aspect of the design methodology, as the selection and sizing of the units is carried out on the basis of their optimal operation in the selected periods. This work proposes a novel Mixed Integer Linear Program clustering model, named k-MILP, devised to find at the same time the most representative days of the year and the extreme days. k-MILP allows controlling the features of the selected typical and extreme days and setting a maximum deviation tolerance on the integral of the load duration curves. The novel approach is tested on the design of two different multi-energy systems (a multiple-site university Campus and a single building) and compared with the two well-known clustering techniques k-means and k-medoids. Results show that k-MILP leads to a better representation of both typical and extreme operating conditions guiding towards more efficient and reliable designs. (C) 2019 Elsevier Ltd. All rights reserved.
机译:当优化多能量系统的设计时,在优化模型中必须考虑操作策略和单位的部件负载行为,因此必须将其作为两级问题制定。为了保证计算途径,在有限的典型和极端时期,解决了操作问题。这些时段的选择是设计方法的一个重要方面,因为基于所选时段中的最佳操作来执行单位的选择和尺寸。这项工作提出了一种新的混合整数线性程序聚类模型,名为K-MILP,设计了同时查找年度最佳日期和极端日子。 K-MILP允许控制所选择的典型和极端日期的特征,并在负载持续时间曲线的积分上设置最大偏差容限。对两种不同的多能量系统(多站点大学校园和单一建筑物)的设计进行了测试的新方法,并与两种众所周知的聚类技术K-Means和K-meats进行比较。结果表明,K-MILP导致引导更有效和可靠的设计的典型和极端操作条件的更好代表性。 (c)2019 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号