MétaCan
Menu
Back to cohort
Record W61930541

A preliminary study for multiple ant colony system with new communication strategies

2005· article· en· W61930541 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

VenueInternational Conference on Communications · 2005
Typearticle
Languageen
FieldComputer Science
TopicMetaheuristic Optimization Algorithms Research
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsAnt colony optimization algorithmsTravelling salesman problemWeightingAnt colonyComputer scienceScheme (mathematics)ANTArtificial intelligenceMathematical optimizationAlgorithmMathematicsComputer network
DOInot available

Abstract

fetched live from OpenAlex

In this paper we apply the concept of parallel processing to enhance the performance of the Ant Colony System algorithm. New communication strategies based on a weighting scheme are introduced under three different types of interactions. The performance of the Multiple Ant Colony System employing these strategies applied to the Traveling Salesman Problem is investigated and evaluated with respect to solution quality and computational effort. The results demonstrate that the Multiple Ant Colony System outperforms the sequential Ant Colony System. The study indicates that the weighting scheme yields a positive influence on performance, particularly in strategies that share pheromone information among all colonies.

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.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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.978
Threshold uncertainty score0.964

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0050.001
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.126
GPT teacher head0.382
Teacher spread0.256 · 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