MétaCan
Menu
Back to cohort
Record W2097036372 · doi:10.1109/ipdps.2008.4536368

Designing hybrid integrative evolutionary approaches to the car sequencing problem

2008· article· en· W2097036372 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.

Bibliographic record

VenueProceedings - IEEE International Parallel and Distributed Processing Symposium · 2008
Typearticle
Languageen
FieldEngineering
TopicAssembly Line Balancing Optimization
Canadian institutionsUniversité du Québec à Chicoutimi
Fundersnot available
KeywordsCrossoverComputer scienceGenetic algorithmEvolutionary computationEvolutionary algorithmComputationHybrid algorithm (constraint satisfaction)Integer programmingGenetic representationMathematical optimizationArtificial intelligenceAlgorithmMachine learningMathematicsLocal consistency

Abstract

fetched live from OpenAlex

In this paper, we present three new integrative approaches for solving the classical car sequencing problem. These approaches are essentially based on a genetic algorithm which incorporates two crossover operators using an integer linear programming model. The two proposed hybrid crossover are combined efficiently in a genetic algorithm and we show that the hybrid approach outperforms a genetic algorithm with local search on the CSPLib benchmarks. Although that the computations time are long when integrative hybridization is used, this study well illustrates the interest of designing hybrid approaches exploiting the strengths of different methods.

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 categoriesMeta-epidemiology (narrow)
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.826
Threshold uncertainty score1.000

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.0010.000
Scholarly communication0.0000.001
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.041
GPT teacher head0.225
Teacher spread0.183 · 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