基于图划分的给水管网泄漏检测算法
A Graph Partitioning Algorithm for Leak Detection in Water Distribution Networks
摘要：
城市供水管网（WDN）的泄漏检测是具有挑战性的，因为它们的规模，复杂性和有限的仪器。我们提出了一种算法，用于WDN中的泄漏检测，其中包括按需进行额外的流量测量，并重复使用水平衡。图划分用于确定流量测量的位置，目标是最小化测量成本。我们采用分阶段解决的方法。在每个阶段中，被识别为包含泄漏的WDN的一部分被划分为两个或更多个子网络，并且水平衡用于跟踪泄漏到这些子网络中的一个。这个过程递归地继续，直到达到所需的分辨率。我们研究了不同的方法来解决所出现的图分割问题，如整数线性规划（ILP）和谱平分。所提出的方法进行了测试，在大规模的基准网络，我们的结果表明，平均而言，不到3%的管道需要进行测量，以找到在大型网络的泄漏。
英文摘要：
Leak detection in urban water distribution networks (WDNs) is challenging given their scale, complexity, and limited instrumentation. We present an algorithm for leak detection in WDNs, which involves making additional flow measurements on-demand, and repeated use of water balance. Graph partitioning is used to determine the location of flow measurements, with the objective to minimize the measurement cost. We follow a multi-stage divide and conquer approach. In every stage, a section of the WDN identified to contain the leak is partitioned into two or more sub-networks, and water balance is used to trace the leak to one of these sub-networks. This process is recursively continued until the desired resolution is achieved. We investigate different methods for solving the arising graph partitioning problem like integer linear programming (ILP) and spectral bisection. The proposed methods are tested on large scale benchmark networks, and our results indicate that on average, less than 3% of the pipes need to be measured for finding the leak in large networks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
