A new stochastic control approach to multireservoir operation problems with uncertain forecasts
Bibliographic record
Abstract
This paper presents a new stochastic control approach (NSCA) for determining the optimal weekly operation policy of multiple hydroplants. This originally involves solving an optimization problem at the beginning of each week to derive the optimal storage trajectory that maximizes the energy production during a study horizon plus the water value stored at the end of the study horizon. Then the derived optimal storage at the end of the upcoming week is used as the target to operate the reservoir. This paper describes the inflow as a forecast‐dependent white noise and demonstrates that the optimal target storage at the end of the upcoming week can be equivalently determined by solving a real‐time model. The real‐time model derives the optimal storage trajectory that converges to the optimal annually cycling storage trajectory (OACST) at the end of a real‐time horizon, with the OACST determined by solving an annually cycling model. The numerical examples with one, two, three, and seven reservoirs are studied in detail. For systems of no more than three reservoirs, the NSCA obtains results similar to those obtained with SDP even using a simple inflow forecasting model AR (1). A hypothetical numerical example with 21 reservoirs is also tested. The NSCA is conceptually superior to the other approaches for problems that are computationally intractable due to the number of reservoirs in the system.
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.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".