{"id":"W2065275668","doi":"10.1109/ictai.2006.34","title":"Ant Colony with Stochastic Local Search for the Quadratic Assignment Problem","year":2006,"lang":"en","type":"article","venue":"Proceedings - International Conference on Tools with Artificial Intelligence, TAI","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Quadratic assignment problem; Mathematical optimization; Ant colony optimization algorithms; Ant colony; Computer science; Quadratic equation; Local search (optimization); ANT; Quadratic programming; Mathematics; Combinatorial optimization; Computer network","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":[],"consensus_categories":[],"category_scores_codex":[0.0005659182,0.0003161005,0.0002386637,0.0001719617,0.0002512201,0.0006285136,0.0005127226,0.00009378924,0.0001518971],"category_scores_gemma":[0.00006996701,0.0002131605,0.00005122972,0.0003692768,0.0002579941,0.0003235189,0.00003802743,0.0003503996,0.00003935052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002481045,"about_ca_system_score_gemma":0.0001302131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004574072,"about_ca_topic_score_gemma":0.00004662664,"domain_scores_codex":[0.9978864,0.00001626538,0.0005053803,0.000414013,0.0007170556,0.0004609368],"domain_scores_gemma":[0.9983962,0.000346238,0.0001303433,0.0001314209,0.0009055643,0.0000902993],"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.0003023601,0.0000849947,0.000127668,0.00003738844,0.0000828514,0.000001749657,0.0002849959,0.6926553,0.00100076,0.2852643,0.0001367948,0.02002085],"study_design_scores_gemma":[0.0001388037,0.0005160986,0.00008195668,0.0001839466,0.00004125851,0.00001579453,0.001684952,0.9704519,0.01985272,0.006476485,0.0002204627,0.0003356314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01158317,0.00001490907,0.9758209,0.00122391,0.0002009791,0.001179821,0.00002859993,0.0002388768,0.009708834],"genre_scores_gemma":[0.9722158,0.000007622648,0.02653316,0.00006838402,0.0002640293,0.0005489294,0.00002565308,0.00005878693,0.0002776401],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9606326,"threshold_uncertainty_score":0.8692433,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0709008042347709,"score_gpt":0.3054271221474704,"score_spread":0.2345263179126995,"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."}}