{"id":"W2033338535","doi":"10.1007/s12293-013-0129-z","title":"A bare-bones ant colony optimization algorithm that performs competitively on the sequential ordering problem","year":2014,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Brandon University","funders":"Missouri University of Science and Technology; University of Missouri; Intelligent Systems Center; National Science Foundation","keywords":"Ant colony optimization algorithms; Ant colony; Computer science; Algorithm; State (computer science); Complex system; ANT; Mathematical optimization; Artificial intelligence; 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.0004916363,0.000602819,0.0007860097,0.0006774805,0.0006591766,0.0008313753,0.001675997,0.001408468,0.005249204],"category_scores_gemma":[0.001945364,0.0003250111,0.0004193781,0.000914493,0.0004514576,0.0006221279,0.0008384195,0.0008355241,0.001428755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003879825,"about_ca_system_score_gemma":0.001161128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002357699,"about_ca_topic_score_gemma":0.004345292,"domain_scores_codex":[0.9996746,0.00006123289,0.00001469519,0.00004669722,0.0001657979,0.00003711424],"domain_scores_gemma":[0.9995397,0.0001456845,0.00003657048,0.00007460832,0.0001403202,0.00006301456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004625486,0.0004968156,0.001170359,0.0002579435,0.0001318614,0.0002826109,0.0001092772,0.4214564,0.02536611,0.02472197,0.01385475,0.5116894],"study_design_scores_gemma":[0.0000780837,0.0001162482,0.0001523072,0.000007857204,0.00001931491,0.0001296819,0.0000132439,0.9871818,0.002677436,0.003946976,0.00566386,0.00001323799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0590882,0.0005157902,0.899826,0.0006388432,0.0006594944,0.0002941756,0.0001423615,0.002906853,0.03592826],"genre_scores_gemma":[0.2254467,0.0002240134,0.7577841,0.0002865375,0.0001202254,0.0001793905,0.0002062587,0.0003970087,0.01535584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005249204,"threshold_uncertainty_score":0.0175603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02994336098687184,"score_gpt":0.2619239946884852,"score_spread":0.2319806337016134,"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."}}