Network hydraulics play a major role in the design and operation stage of District Heating (DH) systems, considering further hydraulic complexities expected in the near future. This paper presents a mathematical solution procedure that computes the network hydraulics, tailored as unique to the principal basis behind the branched type of DH networks. The procedure makes use of simple input data (i.e., pipe-node list) to obtain the mathematical description of the network layout via detection algorithms for the incidence and the loop matrices (the pseudo-code given). The matrix-based solution procedure was formulised to detect the network flow and pressure distributions either by use of the Newton-Raphson or genetic algorithms, based on the conservations of mass and energy. The problem formulation was maintained as correcting the end-user flow rates that satisfy the energy conservation throughout the closed loops of the network, which sped up the convergence to a solution. The developed model was used in a case study consisting of 220 × 2 pipe segments (supply and return) and 214 end-users, the results being obtained in 35.5 s via the Newton-Raphson algorithm. Despite the sensitivity analysis, the genetic algorithm was found to have premature convergences under various trials.

网络液压在区域供热 (DH) 系统的设计和运行阶段发挥着重要作用，考虑到在不久的将来预计会出现更多的液压复杂性。本文提出了一种计算网络水力学的数学求解程序，根据支链类型 DH 网络背后的主要基础量身定制。该过程利用简单的输入数据（即管道节点列表）通过关联矩阵和循环矩阵的检测算法（给出的伪代码）获得网络布局的数学描述。基于质量和能量守恒的基于矩阵的求解程序被公式化，以通过使用 Newton-Raphson 或遗传算法来检测网络流量和压力分布。问题公式被保留为修正满足整个网络闭环能量守恒的最终用户流量，从而加速收敛到解决方案。开发的模型用于由 220 × 2 管段（供应和返回）和 214 个最终用户组成的案例研究，结果通过 Newton-Raphson 算法在 35.5 秒内获得。尽管进行了敏感性分析，但发现遗传算法在各种试验下存在早熟收敛。