MétaCan
Menu
Back to cohort

OPTIMAL CONDUCTOR SELECTION OF RADIAL DISTRIBUTION NETWORKS USING FUZZY ADAPTATION OF EVOLUTIONARY PROGRAMMING

2006· article· en· W1982828831 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueInternational Journal of Power and Energy Systems · 2006
Typearticle
Languageen
FieldEngineering
TopicOptimal Power Flow Distribution
Canadian institutionsnot available
Fundersnot available
KeywordsConductorSelection (genetic algorithm)Mathematical optimizationVoltageFuzzy logicAdaptation (eye)Evolutionary programmingDistribution (mathematics)Evolutionary algorithmComputer scienceControl theory (sociology)MathematicsEngineeringElectrical engineeringPhysicsArtificial intelligenceMathematical analysisGeometry

Abstract

fetched live from OpenAlex

The paper proposes a novel method for selecting an optimal branch conductor for radial distribution networks based on fuzzy adaptation of evolutionary programming (FEP). The aim of optimal conductor size selection for each branch is to minimize an objective function, which is the sum of capital investment and cost of capitalized energy loss. Optimal conductor type is determined for each branch by using FEP. To minimize voltage violation, a voltage deviation index (VDI) is defined and implemented in FEP. An attempt has been made to reduce the system losses in the existing radial distribution system while minimizing voltage violation minimum. Suitable practical examples are presented to demonstrate the effectiveness 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.

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.000
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: Empirical
Teacher disagreement score0.379
Threshold uncertainty score0.474

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.008
GPT teacher head0.213
Teacher spread0.205 · 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