Application of Electrical Circuit Theories for Solving Water Distribution Network (WDN) Problems

  • 08



Name of the Speaker: Raman Balireddy (EE17D302)
Guide: Dr. Anjan Chakravorty
Dr. Soumendra Nath Kuiry
Link: Conference Room (BSB 333 – Second Floor)
Date/Time: 8th February 2023 (Wednesday), 4:00 PM

The boundaries of existing cities are expanding rapidly due to the exponential growth in urban population. Therefore, the existing water distribution network (WDN) system needs to be extended to the newly developed areas to meet the additional demand. The optimal design of a sub-network planned for network expansion requires multiple simulations under various constraints. Simulating the additional sub-network along with the existing network takes a lot of CPU time. The size of the problem becomes larger when the stochastic nature of domestic demands, optimal design and layouts, control, and operation of various hydraulic components are considered. In this study, network reduction methodologies are developed for single and multi-port connections using the Thevenin theorem. The number of network elements in the equivalent network obtained using the Thevenin theorem is significantly less than the ones obtained by the existing WDN reduction methods. It is possible to reorganize and expand a large existing network from a prior knowledge of the most sensitive portion of the large network. The accuracy and robustness of the proposed reduction methodologies are investigated on realistic WDNs by comparing the results with the established hydraulic simulator, EPANET. The applications of a single-port Thevenin equivalent network for optimal subnetwork design and for finding the economic diameter for maximum power transfer are evaluated. Therefore, the proposed network reduction methods can greatly benefit hydraulic engineers. Finally, we shall discuss an equivalent network construction methodology based on multiple measurements at different nodal points of a large network for which a complete layout information is unavailable.