Comparison Of Demand Pattern Calibration In Water Distribution Networks With Geographic And Non-Geographic Parameterization

Demands are one of the most uncertain parameters in a water distribution network model. A good calibration of the model demands leads to better solutions when using the model for any purpose. A demand pattern calibration methodology that uses a priori information has been developed for calibrating the behaviour of demand groups. Generally, the behaviours of demands in cities are mixed all over the network, contrary to smaller villages where demands are clearly sectorised in residential neighbourhoods, commercial zones and industrial sectors. Demand pattern calibration has a final use for leakage detection and isolation. Detecting a leakage in a pattern that covers nodes spread all over the network makes the isolation unfeasible. Besides, demands in the same zone may be more similar due to the common pressure of the area rather than for the type of contract. For this reason, the demand pattern calibration methodology is applied to a real network with synthetic non-geographic demands for calibrating geographic demand patterns. The results are compared with a previous work where the calibrated patterns were also non-geographic.

A Gradient-Type Method For Real-Time State Estimation Of Water Distribution Networks

Drinking water distribution networks risk exposure to malicious or accidental contamination. Several levels of responses are conceivable. One of them consists to install a sensor network to monitor the system on real time. Once a contamination has been detected, this is also important to take appropriate counter-measures. In the SMaRT-OnlineWDN project, this relies on modeling to predict both hydraulics and water quality. An online model use makes identification of the contaminant source and simulation of the contaminated area possible. The objective of this paper is to present SMaRT-OnlineWDN experience and research results for hydraulic state estimation with sampling frequency of few minutes. A least squares problem with bound constraints is formulated to adjust demand class coefficient to best fit the observed values at a given time. The criterion is a Huber function to limit the influence of outliers. A Tikhonov regularization is introduced for consideration of prior information on the parameter vector. Then the Levenberg-Marquardt algorithm is applied that use derivative information for limiting the number of iterations. Confidence intervals for the state prediction are also given. The results are presented and discussed on real networks in France and Germany.