{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007490584,0.0005201458,0.000743175,0.0004363962,0.0002949878,0.0004743607,0.000705009,0.0006000861,0.001350637],"category_scores_gemma":[0.002051557,0.00024152,0.0005534054,0.0008094913,0.0004367147,0.000528138,0.000574043,0.0006879524,0.0002987062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000358021,"about_ca_system_score_gemma":0.0007895183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003646366,"about_ca_topic_score_gemma":0.003227748,"domain_scores_codex":[0.9995221,0.0002098466,0.00001555827,0.00004601527,0.0001796783,0.00002672935],"domain_scores_gemma":[0.9995435,0.0002703672,0.00005279615,0.00003676595,0.00007669057,0.00001983881],"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.00002913477,0.00003142358,0.0001516017,0.000063962,0.00002278342,0.00005441835,0.00003260199,0.9561584,0.001522678,0.007686684,0.0009496285,0.03329667],"study_design_scores_gemma":[0.0000088857,0.00001766361,0.00003878406,0.000001923429,0.000003810675,0.00001541947,0.000002717426,0.9972582,0.0001909424,0.001897122,0.0005618309,0.000002653707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01356003,0.0003638183,0.9819645,0.0001553389,0.00002862103,0.0000473708,0.00001893081,0.0003919259,0.003469388],"genre_scores_gemma":[0.5601136,0.000652134,0.4319293,0.0001164349,0.00006309849,0.0003120909,0.0001387686,0.0001355129,0.006538986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003646366,"threshold_uncertainty_score":0.007250309,"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."}}