Energy Storage Planning for Profitability Maximization by Power Trading and Ancillary Services Participation
Bibliographic record
Abstract
One of the main applications of energy storage systems (ESSs) is transmission and distribution systems cost deferral. Further, ESSs are efficient tools for localized reactive power support, peak shaving, and energy arbitrage. This article proposes an ESSs planning algorithm that includes all previous services. The proposed algorithm increases the distribution company profit and minimizes its future system upgrade cost. For a comprehensive planning algorithm, other options, such as including static VAR compensators (SVCs), feeders upgrade, or adding distributed generators, are considered along with ESSs. Different scenarios are utilized to model the load variation, the renewable resources’ intermittency, and the market price fluctuation. The problem constraints include an ESS dynamic model that reflects the capacity and lifetime limitations. Different battery technologies with different costs and dynamic characteristics are compared. The network power flow model is added to account for the voltage level and feeders’ capacity. Power limits constraints are included for the DGs and SVCs as well. The optimization problem is formulated as a mixed-integer quadratic programming problem. To validate the proposed technique, a case study is conducted on a real 41-bus radial feeder in Ontario, Canada using real data for renewable sources, loads, and market prices.
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.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| 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.006 | 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".