Shankar Narasimhan S

Urban water distribution networks (WDNs) are large scale complex systems with limited instrumentation. Due to aging and poor maintenance, significant loss of water can occur through leaks. We present a method for leak detection in WDNs using repeated water balance and minimal use of additional off-line flow measurements. A multi-stage graph partitioning approach is used to determine where the off-line flow measurements are to be made, with the objective of minimizing the measurement cost. The graph partitioning problem is formulated and solved as a multi-objective mixed integer linear program (MILP). We further derive an approximate method inspired by spectral graph bisection to solve the MILP, which is suitable for very large scale networks. The proposed methods are tested on large scale benchmark networks, and the results indicate that on average, flows in less than 3% of the pipes need to be measured to identify the leaky pipe or joint.

Optimal operation of water distribution networks (WDNs) is concerned with meeting consumer demands at desired pressures in an efficient and equitable manner while conserving resources. This can be achieved by implementing advanced control schemes such as model predictive control (MPC). If sufficient water is available, the control objective is to meet consumer demands while preventing wastage. On the other hand, if the available water is insufficient or inadequate to meet consumer demands at the required pressures, equitable distribution of the available resource is of primary importance. In this contribution, a nonlinear model predictive controller is proposed for optimal operation of WDNs that can deal with both the above situations. The proposed approach takes into account availability of storage facilities at the source and demand points. In addition, the control algorithm can account for plant-model mismatch. Performance of the proposed model based control strategy is illustrated through numerical simulations of an illustrative WDN operating under various water availability scenarios. In the water sufficient scenario, the proposed MPC strategy is able to meet the consumer requirements while minimizing the excess amount of water supplied. In the water deficient scenario, the MPC algorithm is able to exploit the available storage facilities at consumer end to reduce the daily supply deficit by about 20%. Using a longer prediction horizon in MPC results in a further reduction of about 40% in the daily supply deficit.

The nexus between water and energy reveals that transporting water for end use is a highly energy intensive operation. In this work we consider the optimal operation of a water distribution network consisting of pumps delivering water to different reservoirs, with each reservoir catering to a time varying demand. Pumps and ON/OFF valves are used as manipulated variables to minimize energy consumption while meeting the demand. Due to the nonlinear nature of the pump operating curve and the hydraulics, this results in a Mixed Integer Nonlinear Program (MINLP). We propose a three step decomposition approach to solve this problem efficiently. The applicability of this technique is demonstrated on a water network proposed for a municipality in India and the potential advantages are reported. We also compare the solution times required for the proposed technique and a standard solver and demonstrate the efficiency of the proposed approach.

Estimation of pipe roughness coefficients is an important task to be carried out before any water distribution network model is used for online applications such as monitoring and control. In this study, a combined state and parameter estimation model for water distribution networks is presented. Typically, estimation of roughness coefficient for each individual pipe is not possible due to non-availability of sufficient number of measurements. In order to address this problem, a formal procedure based on K-means clustering algorithm is proposed for grouping the pipes which are likely to have the same roughness characteristics. Also, graph-theoretic concepts are used to reduce the dimensionality of the problem and thereby achieve significant computational efficiency. The performance of the proposed model is demonstrated on a realistic urban water distribution network. © 2009 Springer Science+Business Media B.V.