Development of a methodology, rational and zoning scheme for the demarcation of complicated water distribution networks is important for making the zone demarcation process more accurate, economical, less time consuming, fast, repeatable, generic and optimal with respect to the cost of flow meters required. A new water distribution zone demarcation method is presented that uses the analogy of graph theoretic and graph partitioning principles used in distributed computing to distribute workloads among processors to suggest optimal zoning schemes based on balancing length, demand or flow within zones with the objective of monitoring of unaccounted for water. The method is developed into an automated prototype optimal zoning tool using C++ programming language, a graph partition tool used in distributed computing (METIS) and the EPANET tool kit. The tool is operated by a user interface written in the Python. Case studies are presented to demonstrate how the zoning tool is applied to the zone demarcation problem for the developed zoning schemes. The developed zone demarcation tool was observed to be an efficient and effective approach for the optimal demarcation of complicated water networks into optimal zones based on balancing length, demand or flow within zones. However the tool is sensitive to the number of partitions, the topology of the Water distribution network and the partitioning algorithms used. The tool can be used as a decision support tool for the optimal development and reduction of uncertainties in development of leakage control zones by decision makers. This will enable water companies to increase their productivities and also optimise resource allocations by reduction of the time to monitor, discover leaks and partition zones. This will lead to improved operating revenues
[1]
B. Hendrickson.
The Chaco User � s Guide Version
,
2005
.
[2]
Bruce Hendrickson,et al.
The Chaco user`s guide. Version 1.0
,
1993
.
[3]
Vipin Kumar,et al.
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
,
1998,
SIAM J. Sci. Comput..
[4]
Bradford L. Chamberlain,et al.
Graph Partitioning Algorithms for Distributing Workloads of Parallel Computations
,
2001
.
[5]
Rajiv Gupta,et al.
Extended Use of Linear Graph Theory for Analysis of Pipe Networks
,
2000
.
[6]
Jochen Deuerlein,et al.
Efficient Supply Network Management Based on Linear Graph Theory
,
2008
.
[7]
Robert van Engelen,et al.
Graph Partitioning for High Performance Scienti c Simulations
,
2000
.
[8]
Shashi Shekhar,et al.
Multilevel hypergraph partitioning: applications in VLSI domain
,
1999,
IEEE Trans. Very Large Scale Integr. Syst..
[9]
Vipin Kumar,et al.
Analysis of Multilevel Graph Partitioning
,
1995,
Proceedings of the IEEE/ACM SC95 Conference.
[10]
Bogumil Ulanicki,et al.
Parallel Computing in Water Network Analysis and Leakage Minimization
,
2000
.
[11]
Shashi Shekhar,et al.
Multilevel hypergraph partitioning: application in VLSI domain
,
1997,
DAC.
[12]
Vipin Kumar,et al.
Multilevel Algorithms for Multi-Constraint Graph Partitioning
,
1998,
Proceedings of the IEEE/ACM SC98 Conference.