检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:韩四维 朱婵霞 潘杭萍 殷俊平 奚巍民 HAN Siwei;ZHU Chanxia;PAN Hangping;YIN Junping;XI Weimin(State Grid(Suzhou)City and Energy Research Institute Co.,Ltd.,Suzhou 215163,China)
机构地区:[1]国网(苏州)城市能源研究院有限责任公司,江苏苏州215163
出 处:《电力需求侧管理》2024年第4期9-15,共7页Power Demand Side Management
基 金:国网(苏州)城市能源研究院有限责任公司项目(CEKY23043)。
摘 要:能源站选址及热力管网规划,是区域冷热能源站规划过程中最值得关注的问题之一。现有能源站选址及热力管网规划算法大多采用“两步法”,将负荷点分配问题与管网布局问题进行割裂处理,使得决策过程中的决策依据不一致,从而导致负荷点分配与管网布局的结果可能并非最优。针对该问题,提出了一种基于动态并行竞争机制的区域能源站多站选址及热力管网规划算法,算法直接对负荷点连接各能源站管网的方式进行比选,同步确定负荷点的归属及相应的管网最优布置方案。算例分析表明,所提出的动态并行竞争算法能够保证负荷点分配问题与管网布局两个问题的决策一致性,从而使规划结果相对于传统“两步法”而言更优。The selection of energy station sites and planning of thermal network layout are one of the most crucial aspects in the process of regional district heating and cooling station planning.Existing algorithms for energy station site selection and thermal network planning mostly adopt a“two-step method”which separates the problem of load allocation from that of network layout,leading to inconsistent deci-sion-making criteria during the decision process.In consequence,the result of load allocation as well as the network layout may not be opti-mal.To address this issue,a multi-site selection and thermal network planning algorithm based on dynamic parallel competition mecha-nism is proposed.This algorithm directly compares the ways in which loads are connected to various energy station networks,synchronous-ly determining the ownership of load points and corresponding optimal network layout schemes.Case studies demonstrate that the pro-posed dynamic parallel competition algorithm ensures consistency between load allocation and network layout decisions,thereby yielding superior planning results compared to the traditional“two-step method”.
分 类 号:TM73[电气工程—电力系统及自动化] TK01[动力工程及工程热物理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7