Graph theory based single and multiple source water distribution network partitioning

A graph theory based methodology for design of water network partitioning is proposed. Both multiple and single source networks are considered. In the first case the partition refers to the definition of isolated sectors, each of them supplied by its own sources. The shortest paths from each water s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Tecnología y Ciencias del Agua Jg. 10; H. 6; S. 197 - 221
Hauptverfasser: Tzatchkov, Velitchko G., Alcocer-Yamanaka, Victor H.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Jiutepec Instituto Mexicano de Tecnologia de Agua 01.11.2019
Schlagworte:
Branches
Chords (geometry)
Clustering
Design
Design flow
Distribution
Distribution management
Flow rates
Flow velocity
Genetic algorithms
Graph theory
Networks
Nodes
Optimization techniques
Partitioning
Pipes
Recursive methods
Separators
Shortest-path problems
Trees
Water distribution
Water engineering
Water quality
Water shortages
Water supply
ISSN:2007-2422, 0187-8336, 2007-2422
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A graph theory based methodology for design of water network partitioning is proposed. Both multiple and single source networks are considered. In the first case the partition refers to the definition of isolated sectors, each of them supplied by its own sources. The shortest paths from each water source to each network node are found and each network node is assigned to be supplied exclusively by the source with the shortest path distance to it. The pipes to be closed are the edge separators of such partition. In the second case the partitioning problem refers to a division of the network in relatively small district metering areas (DMAs) each of them fed by a single pipe. A hierarchical tree for the graph is constructed using a breadth-first search. A recursive approach is applied on this tree to find the design flow rates in each pipe summing the demand of descendant nodes. Based on these flow rates the nodes belonging to each DMA are found. The pipes to be closed are defined as the chords between branches of the hierarchical tree lying below the feeding pipe. The procedure has been tested on a real medium city all-pipe water distribution network model.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2007-2422
0187-8336
2007-2422
DOI:10.24850/j-tyca-2019-06-08