MétaCan
Menu
Back to cohort

A Numerical Method for Wind Farm Condition-Based Maintenance Policy Assessment

2019· article· en· W3003483289 on OpenAlexaff
Zhigang Tian, Fangfang Ding, Han Zhang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicMachine Fault Diagnosis Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsWind powerTurbineOptimal maintenanceMaintenance engineeringReliability (semiconductor)Reliability engineeringMaxima and minimaCondition-based maintenanceComputer scienceDependency (UML)Convergence (economics)Process (computing)Mathematical optimizationEngineeringPower (physics)Mathematics

Abstract

fetched live from OpenAlex

The cost of wind energy is greatly affected by wind farm reliability and maintenance management. In this paper, we focus on condition-based maintenance (CBM) optimization for wind farms considering multiple turbines, while each turbine involves multiple components. In previous studies, economic dependency among multiple turbines and multiple components in a turbine were considered, and a simulation-based method was developed for wind farm CBM policy cost evaluation [1]. The simulation-based method was flexible in modeling various scenarios and factors, but due to its sampling-based nature, there are variations in CBM cost evaluation, and the resulting CBM cost function surface is not quite smooth. This could lead to a challenge in the optimization process and cause local minima or convergence problems. Thus, an accurate numerical method is desired. In this paper, a numerical method is proposed to assess the overall maintenance cost of the CBM policy. Therefore, the optimal maintenance policy corresponding to the minimum maintenance cost is more accurately determined compared to the simulation 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.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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0050.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.007
GPT teacher head0.355
Teacher spread0.348 · 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

Citations0
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicMachine Fault Diagnosis TechniquesFrench-language works237,207