{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006761959,0.0006342786,0.0006759801,0.0005905511,0.000675501,0.0009296905,0.001190264,0.0009578226,0.003979328],"category_scores_gemma":[0.001881432,0.0002574486,0.0003504778,0.0005646416,0.0004575156,0.001004428,0.0008475832,0.0005622081,0.0003444687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005509838,"about_ca_system_score_gemma":0.000475531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001720975,"about_ca_topic_score_gemma":0.001244712,"domain_scores_codex":[0.9996874,0.0001331009,0.00001450909,0.00003046055,0.00009076243,0.0000437006],"domain_scores_gemma":[0.9995689,0.0002254351,0.00005007855,0.0000328629,0.00009015395,0.0000325359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001691625,0.0001272408,0.0004487816,0.0001601632,0.00007664483,0.0001730006,0.0002589232,0.8225521,0.004924398,0.09110589,0.002569691,0.07743397],"study_design_scores_gemma":[0.00002072708,0.00005219381,0.00007749219,0.000005565486,0.00001140266,0.00003595757,0.0000281284,0.9857314,0.0003981051,0.01272296,0.0009106991,0.000005354829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1347568,0.001412247,0.8273141,0.0006949479,0.0001847693,0.0002162313,0.00004902351,0.0002505035,0.03512123],"genre_scores_gemma":[0.9177901,0.0003870265,0.06929144,0.00007599818,0.00003541245,0.0001690287,0.00003391182,0.00005146597,0.0121656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003979328,"threshold_uncertainty_score":0.01331216,"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."}}