MétaCan
Menu
Back to cohort
Record W2122492517 · doi:10.1109/pes.2007.386176

Analysis of Network Rental in the Competitive Electricity Market

2007· article· en· W2122492517 on OpenAlexafffund
L.Y.C. Amarasinghe, U.D. Annakkage

Bibliographic record

VenueIEEE Power Engineering Society General Meeting · 2007
Typearticle
Languageen
FieldEngineering
TopicElectric Power System Optimization
Canadian institutionsUniversity of Manitoba
FundersNatural Sciences and Engineering Research Council of CanadaManitoba Hydro
KeywordsRentingKarush–Kuhn–Tucker conditionsElectricityElectricity marketRevenueConstraint (computer-aided design)Electricity generationComputer scienceMathematical optimizationMicroeconomicsBusinessOperations researchIndustrial organizationPower (physics)EconomicsEngineeringFinanceMathematics

Abstract

fetched live from OpenAlex

Competitive electricity markets use marginal prices to settle the transactions with generator owners and consumers. This results in charging the consumers more than the average cost of production of electricity due to the nonlinear relationship between the losses and power transmission. This difference in revenue collection, referred to as the network rental in this paper, is further increased if the dispatch is constrained due to any operating limits such as power flow limits. There are two main components that constitute the network rental, loss rental and the constraint rental. This paper presents a theoretical analysis based on Karush-Kuhn-Tucker (KKT) optimality conditions to calculate these different rental components. In this way each rental component can be quantitatively analyzed, which in turn can be used to get a better insight of the operation of the electricity market. Some case studies on the IEEE 30 bus system is presented to demonstrate the application of the proposed method.

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.005
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: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.009
Threshold uncertainty score0.030

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.004
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0090.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.004
GPT teacher head0.199
Teacher spread0.195 · 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

Citations2
Published2007
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Power Engineering Society General MeetingSame topicElectric Power System OptimizationFrench-language works237,207