MétaCan
Menu
Back to cohort

Allotment of aircraft spare parts using genetic alorithms

2003· article· en· W2137812345 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenuePesquisa Operacional · 2003
Typearticle
Languageen
FieldEngineering
TopicReliability and Maintenance Optimization
Canadian institutionsUniversité de Montréal
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsAllotmentSpare partComputer scienceOperations researchTask (project management)Mathematical optimizationGenetic algorithmClass (philosophy)PopulationResource allocationOrder (exchange)Resource (disambiguation)Operations managementMathematicsArtificial intelligenceEngineeringEconomicsMachine learningSystems engineering

Abstract

fetched live from OpenAlex

In this paper we attempt to determine the optimal allocation of aircraft parts used as spares for replacement of defective parts on-board of a departing flight. In order to minimize the cost of delay caused by unexpected failure, Genetic algorithms (GAs) are used to allocate the initial quantity of parts among the airports. GAs are a class of adaptive search procedures, that distinguish themselves from other optimization techniques by the use of concepts from population genetics to guide the search. Problem-specific knowledge is incorporated into the problem and efficient parameters are identified and tested for the task of optimizing the allocation of parts. The approach is illustrated by numerical results.

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.133
Threshold uncertainty score0.456

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