Partition of Water Distribution Networks into District Metered Areas Using a Graph Theoretical Approach

8 pages•Published: September 20, 2018

Abstract

We present a method for partitioning Water Distribution Networks (WDNs) into District Metered Areas (DMAs) by using a spectral graph partitioning algorithm. The effectiveness of DMA design was tested for selected edge weights and multiple numbers of established DMAs. The presented method includes a novel graph theoretic approach to determine and evaluate only relevant combinations of DMA connection. It was tested on a real-life case study for which several different solutions were generated and evaluated against their hydraulic performance. The optimal solution, i.e. design of DMAs, was selected regarding the quality of partition and the cost of WDN segmentation, since hydraulic adequacy was met for all cases where partitioning resulted in connected subgraphs.

Keyphrases: district metered areas, graph theory, spectral graph partitioning, water distribution network

In: Goffredo La Loggia, Gabriele Freni, Valeria Puleo and Mauro De Marchis (editors). HIC 2018. 13th International Conference on Hydroinformatics, vol 3, pages 2417-2424.

Links:	https://easychair.org/publications/paper/F9Sc
	https://doi.org/10.29007/l442

BibTeX entry

@inproceedings{HIC2018:Partition_Water_Distribution_Networks,
  author    = {Jure Zevnik and Daniel Kozelj},
  title     = {Partition of Water Distribution Networks into District Metered Areas Using a Graph Theoretical Approach},
  booktitle = {HIC 2018. 13th International Conference on Hydroinformatics},
  editor    = {Goffredo La Loggia and Gabriele Freni and Valeria Puleo and Mauro De Marchis},
  series    = {EPiC Series in Engineering},
  volume    = {3},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2516-2330},
  url       = {/publications/paper/F9Sc},
  doi       = {10.29007/l442},
  pages     = {2417-2424},
  year      = {2018}}

Download PDF Open PDF in browser