首页> 外文会议>European symposium on computer aided process engineering;ESCAPE 22 >Multi-Objectives, Multi-Period Optimization of district heat- ing networks Using Evolutionary Algorithms and Mixed Inte- ger Linear Programming (MILP)
【24h】

Multi-Objectives, Multi-Period Optimization of district heat- ing networks Using Evolutionary Algorithms and Mixed Inte- ger Linear Programming (MILP)

机译:使用进化算法和混合整数线性规划(MILP)的区域供热网络的多目标,多周期优化

获取原文

摘要

A systematic procedure, including process design and integration techniques for sizing and operation optimization of a poly-generation plant and design of a district heating network is presented in this paper. In the developed model a simultaneous multi objectives and multi-period optimization are principally investigated. The goal is to simultaneously minimize costs and CO_2 emission using multi-objective evolutionary algorithms (EMOO) and Mixed Integer Linear Programming (MILP). Typical days definition and the extension of the post processing phase are the novelty of this work. The proposed method helps the decision maker to know; which type and configuration of poly-generation technologies (centralized and decentralized) are best suited for the district? Is it viable to combine these technologies with other technologies (like heat pumps, solar PV)? Where in the district shall these technologies be implemented (geographically)? what are the optimal flow, supply and return temperatures of the distribution networks (heating and cooling) considering the requirements of the district and the technical limitations of the technologies?
机译:本文提出了一个系统的程序,包括用于多联产电厂的规模和运行优化的过程设计和集成技术,以及区域供热网络的设计。在开发的模型中,主要研究同时多目标和多周期优化。目标是使用多目标进化算法(EMOO)和混合整数线性规划(MILP)同时最小化成本和CO_2排放。典型的工作日定义和后期处理阶段的扩展是这项工作的新颖之处。所提出的方法有助于决策者了解;哪种类型和配置的多联产技术(集中式和分散式)最适合该地区?将这些技术与其他技术(例如热泵,太阳能光伏)相结合是否可行?这些技术应在地区的哪个地方(在地理位置上)实施?考虑到区域的要求和技术的技术局限性,配电网络的最佳流量,供应和返回温度(加热和冷却)是多少?

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号