Optimization of the Kootenay River hydroelectric system with a linear programming model
Bibliographic record
Abstract
The main objective of hydroelectric system optimization is to determine an operating policy for the best use of available resources. In order to find the optimum policy one should decide on the trade-off between the marginal value of water in the reservoirs and the amount of electricity produced electricity. The variability of natural inflows along with local and environmental limitations and special procedures and regulations, makes the decision making process more challenging for an operation planner of a reservoir system. The region considered in this study is the Kootenay River System and it includes five hydroelectric plants and a canal. The main storage reservoir in this system is the Kootenay Lake, which is the largest natural lake in British Columbia, Canada. The operation of the Kootenay system is complex because day-to-day operation decisions should satisfr all existing rules and water treaties and agreements in the area. In addition, a power generation schedule should take advantage of electricity markets and meet local load demands. This thesis developed a Linear Programming model to optimize the operation of the Kootenay system on daily timesteps for studies up to one year. Due to the operational complexities, the Kootenay system was not included in the optimization models developed at B.C Hydro (BCH). This model can be an extension to the existing “STOM” (Short Term Optimization Model) and Generalized Optimization Model “GOM”, which have been successfully adopted by BCH to optimize the daily operation of its plants. This is the first optimization model for the operation of Kootenay System and was developed in accordance with all the existing international treaties and special constraints on this system. Results obtained using the model have indicated that this model can successfully optimize the operation of the Kootenay system. Comparison of this model to the current operation method showed that with respect to all system’s constraints and value of water, the optimization model can yield a higher value of electricity generation and it is expected that it will be added to the set of tools used by the system operation engineers for their daily operations.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".