Impacts of the Integration of Water Demand Prediction in Real Time Control of Water Distribution Systems
Bibliographic record
Abstract
This study evaluates the interest of integrating short-term prediction modules in pressure control algorithms in terms of reduction of: i) leakage rates and ii) occurrence of transient events. A hydraulic model for a real water distribution network was provided by a city in the province of Quebec, Canada. Four control modes (CM) were developed and applied to the network: 1) fixed control (FC); 2) time-based control (TBC); 3) reactive control (RC), and 4) predictive control (PC). The pressure fluctuation intensity (PFI) and the leakage rate (LR) were the performance indices computed for each CM. The impact of the consumption pattern (original vs. contrasted), of the variation of elevation in the system (real elevations vs. flattened profile) and of the age of the network (actual situation vs. aged pipes) were also assessed. It was shown that in all cases, the real time control models (PC and RC) are more effective than the passive ones (TBC and FC). The former models showed better stabilization of the pressure fluctuations and reduction of the leakage rate in the case of contrasted consumption pattern, when the system was flattened and with increasing age (roughness) of the network. The PC was closely followed by the RC in terms of performance. Hence the question is: can optimization of pressure control really benefit from water demand prediction?
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".