{"id":"W2056678525","doi":"10.1016/j.ins.2006.09.016","title":"Exchange strategies for multiple Ant Colony System","year":2006,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ant colony optimization algorithms; Travelling salesman problem; Computer science; Weighting; Ant colony; Scheme (mathematics); Local search (optimization); Metaheuristic; Mathematical optimization; Artificial intelligence; Machine learning; Algorithm; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001200568,0.0000812619,0.0001022515,0.0002813966,0.0004203639,0.00134868,0.0008257414,0.00003476409,0.00001261279],"category_scores_gemma":[0.0001404088,0.00006530309,0.00003327431,0.0007919882,0.0001262828,0.004674369,0.000104256,0.00003799005,0.0001020682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005165146,"about_ca_system_score_gemma":0.0002652442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001731801,"about_ca_topic_score_gemma":0.00001961615,"domain_scores_codex":[0.9985726,0.00003893269,0.0003520257,0.0001506136,0.0006143715,0.0002714963],"domain_scores_gemma":[0.9989898,0.0002458442,0.0001639905,0.0002016363,0.0003480836,0.00005062664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008179451,0.00003833132,0.0003529131,0.0002462121,0.00000638778,0.000001526168,0.001894802,0.06508563,0.00008398008,0.8795998,0.01780826,0.03487401],"study_design_scores_gemma":[0.0002517947,0.00005865357,0.0004240352,0.000009040162,9.093378e-7,0.000006572578,0.0007859551,0.9729049,0.0002143796,0.001005437,0.02424712,0.00009117593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009846078,0.00003049177,0.9768523,0.0003683557,0.0003758793,0.0004028135,0.00001510702,0.0001857368,0.02078474],"genre_scores_gemma":[0.6845203,0.000004272353,0.314813,0.0001477539,0.00008863077,0.000146707,0.0000160236,0.000002686509,0.0002606007],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9078193,"threshold_uncertainty_score":0.999688,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03510963660855574,"score_gpt":0.2952731545360752,"score_spread":0.2601635179275195,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}