Robustness and Vulnerability Analysis of Water Distribution Networks Using Graph Theoretic and Complex Network Principles

2011 ◽  
Author(s):  
A. Yazdani ◽  
P. Jeffrey
Keyword(s):  
Complex Network ◽  
Water Distribution ◽  
Distribution Networks ◽  
Vulnerability Analysis ◽  
Water Distribution Networks ◽  
Graph Theoretic

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

10.29007/l442 ◽  
2018 ◽  
Author(s):  
Jure Zevnik ◽  
Daniel Kozelj
Keyword(s):  
Water Distribution ◽  
Real Life ◽  
Optimal Solution ◽  
Distribution Networks ◽  
Water Distribution Networks ◽  
Theoretic Approach ◽  
Graph Theoretic ◽  
Graph Theoretical Approach ◽  
Connected Subgraphs ◽  
The Cost

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.

Entropy of centrality values for topological vulnerability analysis of water distribution networks

2019 ◽  
Vol 9 (3) ◽  
pp. 412-425 ◽  
Author(s):  
Seyed Ashkan Zarghami ◽  
Indra Gunawan ◽  
Frank Schultmann
Keyword(s):  
Information Entropy ◽  
Water Distribution ◽  
Decision Support Tool ◽  
Distribution Networks ◽  
Vulnerability Analysis ◽  
Significant Loss ◽  
Water Distribution Networks ◽  
Content Type ◽  
Support Tool ◽  
Topological Vulnerability Analysis

Purpose The increased complexity of water distribution networks (WDNs) emphasizes the importance of studying the relationship between topology and vulnerability of these networks. However, the few existing studies on this subject measure the vulnerability at a specific location and ignore to quantify the vulnerability as a whole. The purpose of this paper is to fill this gap by extending the topological vulnerability analysis further to the global level. Design/methodology/approach This paper introduces a two-step procedure. In the first step, this work evaluates the degree of influence of a node by employing graph theory quantities. In the second step, information entropy is used as a tool to quantify the global vulnerability of WDNs. Findings The vulnerability analysis results showed that a network with uniformly distributed centrality values exhibits a lower drop in performance in the case of partial failure of its components and therefore is less vulnerable. In other words, the failure of a highly central node leads to a significant loss of performance in the network. Practical implications The vulnerability analysis method, developed in this work, provides a decision support tool to implement a cost-effective maintenance strategy, which relies on identifying and prioritizing the vulnerabilities, thereby reducing expenditures on maintenance activities. Originality/value By situating the research in the entropy theory context, for the first time, this paper demonstrates how heterogeneity and homogeneity of centrality values measured by the information entropy can be interpreted in terms of the network vulnerability.

Sign in / Sign up

Export Citation Format

Share Document