MétaCan
Menu
Back to cohort
Record W2166418605 · doi:10.1109/tpwrs.2007.901741

Generation and Transmission Expansion Under Risk Using Stochastic Programming

2007· article· en· W2166418605 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Power Systems · 2007
Typearticle
Languageen
FieldEngineering
TopicPower System Reliability and Maintenance
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsMathematical optimizationProbabilistic logicStochastic programmingLinear programmingNonlinear programmingVariance (accounting)Transmission (telecommunications)Node (physics)Computer scienceExpected valueStochastic processRandom variableStochastic optimizationNonlinear systemMathematicsEngineeringStatisticsTelecommunicationsArtificial intelligenceEconomics

Abstract

fetched live from OpenAlex

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> In this paper, a new model for generation and transmission expansion is presented. This new model considers as random events the demand, the equivalent availability of the generating plants, and the transmission capacity factor of the transmission lines. In order to incorporate these random events into an optimization model, stochastic programming and probabilistic constraints are used. A risk factor is introduced in the objective function by means of the mean-variance Markowitz theory. The solved optimization problem is a mixed integer nonlinear program. The expected value of perfect information is obtained in order to show the cost of ignoring uncertainty. The proposed model is illustrated by a six- and a 21-node network using a dc approximation. </para>

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.814
Threshold uncertainty score0.870

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.022
GPT teacher head0.241
Teacher spread0.219 · 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