A platform for research: civil engineering, architecture and urbanism
A Topological Algorithm for Sectorization of Water Distribution Networks
Recent water shortages reflect climate change occurring on the global scale. Therefore, it is essential to promote the conscious use of water and to take measures to reduce wastage. Sectorization is one of the most effective ways to identify and reduce wastewater in water distribution networks (WDNs), dividing the network into isolated district metering areas (i-DMAs). Each i-DMA is supplied by one or more tanks, reservoirs, or pumping stations and is completely separated from the rest of the network by shut-off valves on the boundary pipes. Since implementing i-DMAs can significantly affect network performance, an optimization procedure based on hydraulic simulation may be required for effective design. A well-calibrated network model is crucial for this optimization. However, the calibration process is costly and time-consuming for water utilities (WUs). To overcome these shortcomings, we propose a novel topological algorithm for water network sectorization (TAWS), which relies only on the network layout, the spatial distribution of water demand, and the mean value of the water inflow, all of which are reliably known to WUs. The methodology is tested using different performance indicators on three real WDNs, two of which were already tested in the literature for sectorization, yielding promising results. The TAWS algorithm was implemented in SWANP 4.0 software developed by the authors.
This research introduces a novel topological algorithm for efficient water network sectorization, aiding water utilities in minimizing wastage and optimizing system performance without requiring hydraulic simulations.
A Topological Algorithm for Sectorization of Water Distribution Networks
Recent water shortages reflect climate change occurring on the global scale. Therefore, it is essential to promote the conscious use of water and to take measures to reduce wastage. Sectorization is one of the most effective ways to identify and reduce wastewater in water distribution networks (WDNs), dividing the network into isolated district metering areas (i-DMAs). Each i-DMA is supplied by one or more tanks, reservoirs, or pumping stations and is completely separated from the rest of the network by shut-off valves on the boundary pipes. Since implementing i-DMAs can significantly affect network performance, an optimization procedure based on hydraulic simulation may be required for effective design. A well-calibrated network model is crucial for this optimization. However, the calibration process is costly and time-consuming for water utilities (WUs). To overcome these shortcomings, we propose a novel topological algorithm for water network sectorization (TAWS), which relies only on the network layout, the spatial distribution of water demand, and the mean value of the water inflow, all of which are reliably known to WUs. The methodology is tested using different performance indicators on three real WDNs, two of which were already tested in the literature for sectorization, yielding promising results. The TAWS algorithm was implemented in SWANP 4.0 software developed by the authors.
This research introduces a novel topological algorithm for efficient water network sectorization, aiding water utilities in minimizing wastage and optimizing system performance without requiring hydraulic simulations.
A Topological Algorithm for Sectorization of Water Distribution Networks
Santonastaso, Giovanni F. (author) / Di Nardo, Armando (author) / Creaco, Enrico (author) / Iervolino, Michele (author)
ACS ES&T Water ; 4 ; 4774-4782
2024-11-08
Article (Journal)
Electronic Resource
English
An Improved DeNSE Methodology for Optimal Sectorization of Water Distribution Networks
DOAJ | 2024
|Performance indices for water network partitioning and sectorization
Online Contents | 2015
|Sectorization for Water Distribution Systems with Multiple Sources: A Performance Indices Comparison
DOAJ | 2021
|Water network sectorization based on a genetic algorithm and minimum dissipated power paths
Online Contents | 2013
|