MétaCan
Menu
Back to cohort
Record W2088622475 · doi:10.1109/isap.2007.4441630

Multi-Objective Reactive Power Planning: A Pareto Optimization Approach

2007· article· en· W2088622475 on OpenAlexaff
Steven M. Small, B. Jeyasurya

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicOptimal Power Flow Distribution
Canadian institutionsMemorial University of Newfoundland
Fundersnot available
KeywordsPareto principleComputer scienceSortingEvolutionary algorithmMulti-objective optimizationMathematical optimizationGenetic algorithmSet (abstract data type)AlgorithmArtificial intelligenceMathematicsMachine learningProgramming language

Abstract

fetched live from OpenAlex

Increased load forecasts can severely deteriorate the performance of a power system. Reactive compensation devices are a common method to allow a power system to return to an acceptable performance level for an expected load. Reactive power planning (RPP) is used to determine the optimal placement of reactive devices for a set of objectives. RPP is a large scale multiple objectives highly constrained and partially discrete optimization problem that is very difficult to solve. Evolutionary algorithms have been used to solve RPP problems. However, new multi-objective evolutionary computational techniques have shown the ability to consider an optimization problem's objectives independently for the determination of Pareto Optimal solutions. This paper aims at applying theNon-DominatedSortingGeneticAlgorithmII(NSGAII) to a multi-objective RPP. The results from the case study presented show that there is great potential in the use of evolutionary computation for solving the multi-objective RPP.

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.002
metaresearch head score (Gemma)0.002
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.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.002
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.001
Insufficient payload (model declined to judge)0.0040.001

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.014
GPT teacher head0.245
Teacher spread0.231 · 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

Citations12
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicOptimal Power Flow DistributionFrench-language works237,207