MétaCan
Menu
Back to cohort
Record W2576506249 · doi:10.1109/pica.1989.38977

An automated method for least cost distribution planning

2003· article· en· W2576506249 on OpenAlexaff
C.W. Hasselfield, P. Wilson, L. Penner, Meng Cheng Lau, A.M. Gole

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicOptimal Power Flow Distribution
Canadian institutionsUniversity of ManitobaManitoba Hydro
Fundersnot available
KeywordsSimulated annealingComputer scienceMathematical optimizationProcess (computing)Distribution (mathematics)Computer programFunction (biology)AlgorithmMathematics

Abstract

fetched live from OpenAlex

The authors describe a method of planning changes to a distribution system to meet load projections by minimizing the cost of these changes while ensuring that the system meets required constraints. A computer program uses the method of simulated annealing to evaluate various configurations and to derive the optimal solution. The program evaluates options normally considered in a distribution planning study, such as reconductoring sections of feeders and switching sections of one feeder to another feeder. At each step of the optimization process the program performs a load flow to find the total losses and to check constraints. The objective function to be optimized is the cost of the changes added to the cost of the losses. Several examples demonstrate the effectiveness of this program as a distribution planning tool. As an example of a load balance optimization, a study of two 12.47 kV substations was carried out.>

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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.022
Threshold uncertainty score0.073

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.001
Scholarly communication0.0020.001
Open science0.0020.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0220.005

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.017
GPT teacher head0.323
Teacher spread0.306 · 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
GenreMethods

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

Citations4
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicOptimal Power Flow DistributionFrench-language works237,207