2013
DOI: 10.1007/s11269-013-0421-1
|View full text |Cite
|
Sign up to set email alerts
|

An Automated Tool for Smart Water Network Partitioning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
77
0
1

Year Published

2015
2015
2020
2020

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 100 publications
(78 citation statements)
references
References 19 publications
0
77
0
1
Order By: Relevance
“…These are the Fiedler eigenvector, Ncut methods based on the other eigenvectors and the principal eigenvector. Through the Fielder Eigenvector and Ncut methods, it is possible to face the important and arduous task associated with permanent water network partitioning (WNP) [23]. WNP consists into define optimal discrete network areas, District Meter Area (DMA), aimed to improve the water network management (i.e., water budget, pressure management, or water losses localization).…”
Section: Case Studymentioning
confidence: 99%
See 1 more Smart Citation
“…These are the Fiedler eigenvector, Ncut methods based on the other eigenvectors and the principal eigenvector. Through the Fielder Eigenvector and Ncut methods, it is possible to face the important and arduous task associated with permanent water network partitioning (WNP) [23]. WNP consists into define optimal discrete network areas, District Meter Area (DMA), aimed to improve the water network management (i.e., water budget, pressure management, or water losses localization).…”
Section: Case Studymentioning
confidence: 99%
“…WNP consists into define optimal discrete network areas, District Meter Area (DMA), aimed to improve the water network management (i.e., water budget, pressure management, or water losses localization). This should be done avoiding to negatively affect the hydraulic performance of the system that could be significantly deteriorated by shutting-off some pipes [23,49]. Choosing a suitable number of subregions and their respective layouts by a clustering algorithm is essential to design a WDN partition into DMAs.…”
Section: Case Studymentioning
confidence: 99%
“…The number of sub-zones can be inferred from the desired size of the sub-zones. Similar application of this approach can be found in DiNardo et al (2013b).…”
Section: Graph Partitioning Algorithm Main Stepsmentioning
confidence: 69%
“…The partition of the network is typically achieved by using graph algorithms, e.g. breadth first search and depth first search (Deuerlein, 2008;Perelman and Ostfeld, 2011;Ferrari et al, 2013;DiNardo et al, 2013a), multilevel partitioning (DiNardo et al, 2013b), community structure (Diao et al, 2013), and spectral approach (Her-rera et al, 2010). The selection of pipes that need to be disconnected is found by iterative procedures (Ferrari et al, 2013;Diao et al, 2013) or genetic algorithms (DiNardo et al, 2013a,b).…”
Section: Graphical Abstract 1 Introductionmentioning
confidence: 99%
See 1 more Smart Citation