Leakage Control and Energy Consumption Optimization in the Water Distribution Network Based on Joint Scheduling of Pumps and Valves
Yu Shao, Yanxi Yu, Tingchao Yu and 2 more
Energies · 2019
doi:10.3390/en12152969 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Apart from water quality, leakage control and energy consumption management are the most concerning challenges for water treatment plants (WTPs). The joint scheduling of pumps and pressure reducing valves (PRVs) in the water distribution network can reduce excessive pressure and distribute pressure more evenly, which achieves comprehensive reduction of leakages and energy consumption. Taking into account the main shortcomings of the commonly used methods, such as scheduling pumps or PRVs separately, or optimizing PRV settings when their position is given, etc., this paper has taken the PRV (position and setting) and the working status of variable speed pumps (VSPs) as decision variables and the cost savings contributed by leakage reduction and energy consumption savings as the objective function, which maximized the economic benefits brought by PRV and/or VSP scheduling. A genetic algorithm (GA) was used to optimize the solution under multiple working conditions. The performance of three control strategies (PRV-only scheduling, VSP-only scheduling, and joint scheduling of PRVs and VSPs) are compared to each other based on a small network. Joint scheduling has achieved the best economic benefits in reducing the gross cost (contributed by leakage and energy consumption) of the three control strategies, which results in a leakage reduction of 33.4%, an energy consumption reduction of 25.4%, and a total cost reduction of 33.1%, when compared to the original network, and saving about 1148 m 3 water (7% of the original consumption) and 722 kWh electric energy (25.4% of the original consumption) per day.
Abstract licence: CC BY
References23
23 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.