Water Network Sectorization Based on Graph Theory and Energy Performance Indices

被引:109
作者
Di Nardo, Armando [1 ]
Di Natale, Michele [1 ]
Santonastaso, Giovanni F. [1 ]
Tzatchkov, Velitchko G. [2 ]
Alcocer-Yamanaka, Victor H. [3 ]
机构
[1] Univ Naples 2, Dept Civil Engn, Aversa, Italy
[2] Mexican Inst Water Technol, Urban Hydraul Dept, Jiutepec, Mexico
[3] Mexican Inst ofWater Technol, Hydraul Coordinat Urban Hydraul Dept, Jiutepec, Mexico
关键词
Performance indices; Water distribution network sectorization; Resilience; Graph theory; District metering areas; DISTRIBUTION RELIABILITY; SIMULATION; SYSTEMS; DESIGN;
D O I
10.1061/(ASCE)WR.1943-5452.0000364
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
This paper proposes a new methodology for the optimal design of water network sectorization, which is an essential technique for improving the management and security of multiple-source water supply systems. In particular, the network sectorization problem under consideration concerns the definition of isolated district meter areas, each of which is supplied by its own source (or sources) and is completely disconnected from the rest of the water system through boundary valves or permanent pipe sectioning. The proposed methodology uses graph theory principles and a heuristic procedure based on minimizing the amount of dissipated power in the water network. The procedure has been tested on two existing water distribution networks (WDNs) (in Parete, Italy and San Luis Rio Colorado, Mexico) using different performance indices. The simulation results, which confirmed the effectiveness of the proposed methodology, surpass empirical trial-and-error approaches and offer water utilities a tool for the design of multiple-source WDNs in isolated districts.
引用
收藏
页码:620 / 629
页数:10
相关论文
共 52 条
[1]   Parallel computing in water network analysis and leakage minimization [J].
Alonso, JM ;
Alvarruiz, F ;
Guerrero, D ;
Hernández, V ;
Ruiz, PA ;
Vidal, AM ;
Martínez, F ;
Vercher, J ;
Ulanicki, B .
JOURNAL OF WATER RESOURCES PLANNING AND MANAGEMENT-ASCE, 2000, 126 (04) :251-260
[2]  
[Anonymous], [No title captured]
[3]  
[Anonymous], 2002, An Introduction to MultiAgent Systems
[4]  
[Anonymous], P COMP CONTR WAT IND
[5]  
[Anonymous], 1990, Introduction to Algorithms
[6]  
Biggs N., 1986, GRAPH THEORY 1736 19
[7]   Comparison of Coarsening Schemes for Multilevel Graph Partitioning [J].
Chevalier, Cedric ;
Safro, Ilya .
LEARNING AND INTELLIGENT OPTIMIZATION, 2009, 5851 :191-+
[8]   Decomposition model of a general water supply network graph [J].
Deuerlein, Jochen W. .
JOURNAL OF HYDRAULIC ENGINEERING-ASCE, 2008, 134 (06) :822-832
[9]  
Di Battista G., 1999, Graph drawing: algorithms for the visualization of graphs
[10]  
Di Nardo A., 2011, P 11 INT C COMP CONT, P841