Stacking Battery Energy Storage Revenues in Future Distribution Networks
Bibliographic record
Abstract
Distribution system operators are attracted to battery energy storage systems (BESS) as a smart option to support the distribution network. However, due to its high capital cost, BESS profitability is dependent on the participation in multiple services to stack revenues and rationalize their existence. Yet, revenue stacking is location-dependent based on the available services and regulations. In this paper, specific revenue stacking frameworks are proposed for BESS installed in modern distribution networks that consider the conflicts and synergies that may occur from the involvement in multiple services in practice. A simple yet effective sizing formulation is introduced to find the BESS system size based on the primary service which is to solve the distribution network violations. BESS scheduling is simulated in accordance with the proposed frameworks to maximize the stackable profits for a case study of Northern Ireland. The BESS profitability is investigated through cost-benefit analyses of different technologies for the sole and stacked services. The results show that revenue stacking can boost the annual revenues by 129% with a payback period of 8 years on average. The presented insights are useful for network operators and energy investors in understanding and assessing the profitability of different BESS technologies for various applications.
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.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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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".