MétaCan
Menu
Back to cohort
Record W2052822043 · doi:10.1109/cec.2014.6900566

TraDE: Training device selection via multi-objective optimization

2014· article· en· W2052822043 on OpenAlexaff
Slawomir Wesolkowski, Nevena Francetić, Stuart C. Grant

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMetaheuristic Optimization Algorithms Research
Canadian institutionsDefence Research and Development Canada
Fundersnot available
KeywordsComputer scienceSortingScheduling (production processes)Genetic algorithmTraining (meteorology)MutationComputationPopulationSelection (genetic algorithm)Mathematical optimizationOperator (biology)Artificial intelligenceMachine learningAlgorithmMathematics

Abstract

fetched live from OpenAlex

Training planning is a recurring military problem. Since training programs can utilize multiple training devices with varying costs and training capabilities, selecting the types of devices required is a complex trade-off problem. Furthermore, the placement of these devices is critical due to the time and costs involved in travelling to and from the location of a training device. In this paper, we introduce a device bin-packing-and-location-based model, Training Device Estimation (TraDE), to study the computation of heterogeneous device mixes including the location of each device with respect to numerous objectives including various costs and training time. We apply the multi-objective Non-dominating Sorting Genetic Algorithm II to the TraDE model on a population represented by two-dimensional chromosomes. Finally, we also present a new mutation type to handle the nonlinearity inherent in a dual optimization problem which includes scheduling and location optimization. We clearly show that the new mutation operator produces superior results to the standard mutation operator.

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.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.004
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0020.001
Insufficient payload (model declined to judge)0.0020.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.045
GPT teacher head0.302
Teacher spread0.257 · 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

Citations6
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicMetaheuristic Optimization Algorithms ResearchFrench-language works237,207