English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Leak detection in urban water distribution networks (WDNs) is challenginggiven their scale, complexity, and limited instrumentation. We present analgorithm for leak detection in WDNs, which involves making additional flowmeasurements on-demand, and repeated use of water balance. Graph partitioningis used to determine the location of flow measurements, with the objective tominimize the measurement cost. We follow a multi-stage divide and conquerapproach. In every stage, a section of the WDN identified to contain the leakis partitioned into two or more sub-networks, and water balance is used totrace the leak to one of these sub-networks. This process is recursivelycontinued until the desired resolution is achieved. We investigate differentmethods for solving the arising graph partitioning problem like integer linearprogramming (ILP) and spectral bisection. The proposed methods are tested onlarge scale benchmark networks, and our results indicate that on average, lessthan 3% of the pipes need to be measured for finding the leak in largenetworks.

A Graph Partitioning Algorithm for Leak Detection in Water Distribution Networks