MétaCan
Menu
Back to cohort

Battery Storage System Optimization for Multiple Revenue Streams and Savings

2020· article· en· W3107377586 on OpenAlexaffabout
Abdeslem Kadri, Farah Mohammadi

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicSmart Grid Energy Management
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsRevenueComputer scienceProfit maximizationElectricitySoftware deploymentProfit (economics)MinificationMaximizationScheduling (production processes)Demand responseEnergy storageOperations researchArbitrageEnvironmental economicsMathematical optimizationBusinessOperations managementMicroeconomicsEconomicsEngineeringElectrical engineeringFinance

Abstract

fetched live from OpenAlex

Battery storage systems (BSSs) can be employed for a variety of energy services. Saving in utility charges is one of the revenue streams that can be achieved using a BSS. Demand charges (DC)-one of the major utility charges, especially for large electricity customers-can be reduced using BSSs. Furthermore, a BSS can gain revenues from other services such as demand response (DR) and energy arbitrage (EA). This paper presents an optimization formulation for the sizing and scheduling of the BSS to minimize the monthly energy bill through minimization of DC. Moreover, it counts for EA's revenue as well as the participation in winter and summer DR programs. Based on the market regulations of Ontario (Canada), this study investigates the potential of using BSSs for DC minimization and profit maximization from both EA and DR using real data for a large class-A Canadian electricity customer in Ontario. The results demonstrate the effectiveness of the proposed BSS deployment algorithm in minimizing the overall energy bills of the class-A customers.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.083
Threshold uncertainty score0.164

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0070.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.

Opus teacher head0.010
GPT teacher head0.163
Teacher spread0.153 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations1
Published2020
Admission routes2
Has abstractyes

Explore more

Same topicSmart Grid Energy ManagementFrench-language works237,207