| dc.description.abstract |
Water Distribution Networks (WDNs) are the foundation and backbone of any city. There maintenance and energy costs demand a significant amount of planning. Judicious scheduling operations can prompt significant savings in energy and prevent disruptions in supply and damages. Water passes through a great deal of system hubs (like pumps, valves, tanks, and so on) while moving from source (reservoir) to individual customers. Such system turn into an uncommon instance of packet switched network, and can be modeled based on networking theory. Similar to bandwidth of each network link, every link in a WDN has a fixed and predefined capacity. Given a source and destination node, there can be a specific estimation of most extreme stream of water which is possible between them. In this paper, our aim is to study the link changes in WDN. Depending upon the change in demand at the destination node, the proposed algorithms recommend optimal modifications in the connecting links of the existing network to increase the maximum possible flow. |
en_US |