MétaCan
Menu
Back to cohort
Record W4409603735 · doi:10.61091/jcmcc127b-250

Propagation path optimization of modular product design based on hybrid genetic ant colony algorithm

2025· article· en· W4409603735 on OpenAlexvenueno aff

Bibliographic record

VenueJournal of Combinatorial Mathematics and Combinatorial Computing · 2025
Typearticle
Languageen
FieldEngineering
TopicManufacturing Process and Optimization
Canadian institutionsnot available
Fundersnot available
KeywordsAnt colony optimization algorithmsModular designPath (computing)ANTGenetic algorithmAnt colonyComputer scienceProduct (mathematics)Mathematical optimizationAlgorithmMathematicsMachine learningComputer network

Abstract

fetched live from OpenAlex

In the context of modular product design, optimizing the propagation path for component information and dependencies is critical to enhancing product performance and innovation.Existing methods, such as traditional optimization algorithms, struggle to balance the complexities of multi-objective constraints, scalability, and dynamic interactions inherent in modular design systems.These approaches often fall short in addressing the trade-offs between efficiency and flexibility, particularly in real-time applications and cross-domain generalization.To overcome these challenges, we propose a hybrid genetic-ant colony optimization (GACO) algorithm, which synergistically integrates the global search capabilities of genetic algorithms with the efficient local exploration of ant colony optimization.The method features an adaptive heuristic mechanism for path evaluation and dynamic pheromone adjustment, ensuring robust convergence and adaptability across varying modular design scenarios.Empirical studies demonstrate that the GACO algorithm significantly improves solution quality, convergence speed, and adaptability compared to baseline models.The findings validate the potential of GACO as a transformative approach in modular product design, addressing key issues in propagation path optimization under the framework of intelligent design systems.

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 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.001
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: Methods · Consensus signal: none
Teacher disagreement score0.826
Threshold uncertainty score0.860

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.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.007
GPT teacher head0.207
Teacher spread0.200 · 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 teacher head, 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
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Combinatorial Mathematics and Combinatorial ComputingSame topicManufacturing Process and OptimizationFrench-language works237,207