An optimization model for the energy management of the network of tanks in a drinking water distribution system
Bibliographic record
Abstract
Abstract “L'eau c'est la vie” is a well‐known French expression for “water is life,” which reflects the fact that water is undoubtedly the most vital resource in the world. The main mission for water utility companies is to convey and distribute water that is of acceptable quality to satisfy the demand of the population at any time of the day. In the recent years, achieving this mission has become very challenging for these companies. Indeed, on the one hand, the rapid growth of population and the expansion of urbanization have significantly increased the demand for water, while on the other hand, natural phenomenon, such as drought, as well as the impact of climate changes are making it almost impossible for water distribution companies to convey the right amount of water where and when it is needed. The presence of water storage tanks in a water distribution network is aimed at alleviating this pressure by storing water and distributing it later in response of the variability of the demand across the network. The management of the tanks of the network is done based on the assignment of three‐level set points, which allows to meet the outflow demand of water from each tank, while maintaining the adequate flow rate through the network. The set points define the level at which the valves that enable inflow and outflow of water to the tank have to be switched on or off. However, operating the valves during different periods of the day to meet the water demand may yield extremely high operational cost because opening some of the valves will induce the running of pumps to maintain an adequate flow rate of water in the network. We present a network optimization model for managing the network of storage tanks in a drinking water distribution system while minimizing the total cost of electricity involved. Computational experiments have been conducted on up to three sets of distribution networks. The results show that our proposed optimization model can be used to reduce the operational cost of managing the network of storage tanks for a water distribution system by up to 38%, while still being able to maintain the right amount of water in the tanks.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".