{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002471722,0.0002887513,0.0003253247,0.0002419332,0.0008080111,0.000696079,0.001299293,0.00007402534,0.0001874493],"category_scores_gemma":[0.0004820727,0.0002097618,0.00009308145,0.0008719882,0.0001312918,0.0002348666,0.0008166111,0.0003869863,0.00007450139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001102635,"about_ca_system_score_gemma":0.0001149777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004398868,"about_ca_topic_score_gemma":0.000002535869,"domain_scores_codex":[0.9966916,0.000537212,0.0004575264,0.000676404,0.001012013,0.0006252137],"domain_scores_gemma":[0.9976512,0.000968951,0.0001778078,0.0006966199,0.000353871,0.0001515405],"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.00000857243,0.0001413252,0.0002213019,0.00005428709,0.0000583288,0.00001389712,0.001234347,0.7948489,0.0001059068,0.03330246,0.0002468791,0.1697638],"study_design_scores_gemma":[0.0004512727,0.0001631423,0.000360385,0.00009656049,0.000009330065,0.0000275831,0.00007160979,0.9959341,0.0008786523,0.0003019517,0.001442614,0.0002627796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002851421,0.00002529666,0.9897293,0.00199828,0.0005064386,0.0006144099,0.000002362248,0.0002682971,0.004004179],"genre_scores_gemma":[0.2955492,0.00001509921,0.70351,0.0004173614,0.0002295167,0.0000266157,0.000009711995,0.00003234633,0.0002101148],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2926978,"threshold_uncertainty_score":0.8553839,"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."}}