MétaCan
Menu
Back to cohort
Record W3110512617 · doi:10.1109/oajpe.2020.3031526

Energy Storage as a Service: Optimal Pricing for Transmission Congestion Relief

2020· article· en· W3110512617 on OpenAlexaff
Juan Arteaga, Hamidreza Zareipour, Nima Amjady

Bibliographic record

VenueIEEE Open Access Journal of Power and Energy · 2020
Typearticle
Languageen
FieldEngineering
TopicElectric Power System Optimization
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsService (business)BusinessTransmission (telecommunications)Environmental economicsComputer scienceEconomicsMarketingTelecommunications

Abstract

fetched live from OpenAlex

This paper focuses on pricing Energy Storage as a Service (ESaaS) for Transmission congestion relief (TCR). We consider a merchant storage facility that competes in an electricity market to trade energy and ancillary services on a day-to-day basis. The facility also has the opportunity to provide a firm TCR service to a regional network operator under a long-term contract. Providing the additional TCR service would impose limitations on the facility's ability to fully harvest daily market trade opportunities. Thus, we model the opportunity costs associated with the TCR service and use it in a hybrid cost-value customized pricing technique to determine the risk-constrained optimal price of ESaaS for TCR. Given the long-term nature of the commitment to provide the TCR service, we use the Conditional Value at Risk (CVaR) metric to mitigate the long-term financial risks faced by the facility. The proposed pricing strategy enables the storage owner to estimate the additional financial gains and the associated risks that would likely result from adding the new service to its operation. Numerical simulations are provided to support the proposed methodology.

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.001
metaresearch head score (Gemma)0.003
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.006
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0020.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.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.021
GPT teacher head0.285
Teacher spread0.264 · 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

Citations22
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Open Access Journal of Power and EnergySame topicElectric Power System OptimizationFrench-language works237,207