{"id":"W2076520672","doi":"10.1023/b:anor.0000039518.73626.a5","title":"GENI Ants for the Traveling Salesman Problem","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Travelling salesman problem; Heuristic; Theory of computation; Benchmark (surveying); Mathematical optimization; Ant colony optimization algorithms; Probabilistic logic; Computer science; Ant colony; Bottleneck traveling salesman problem; Set (abstract data type); Nearest neighbour algorithm; Traveling purchaser problem; 2-opt; Mathematics; Algorithm; Artificial intelligence","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.004060594,0.00008899016,0.000136504,0.0002602372,0.0008548106,0.0004114754,0.001517043,0.00005155618,0.00004217071],"category_scores_gemma":[0.001075476,0.00006357532,0.00007263923,0.001235126,0.0002115856,0.0004144908,0.0002744165,0.0002653172,0.00005838804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002346272,"about_ca_system_score_gemma":0.0006782581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001698392,"about_ca_topic_score_gemma":0.00006850684,"domain_scores_codex":[0.997605,0.0002136031,0.0003561278,0.0003311053,0.00099378,0.0005003716],"domain_scores_gemma":[0.9959151,0.0005852791,0.00002419475,0.0007444965,0.002609429,0.0001215032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000204842,0.0003308617,0.00002207926,0.00006091582,0.00008648566,0.000005600994,0.002162745,0.4650867,0.002671116,0.479348,0.003698128,0.04650689],"study_design_scores_gemma":[0.0006542428,0.0003076314,0.0004501048,0.00003888165,0.000003105487,0.000009271831,0.0001717493,0.9559102,0.02640718,0.01069329,0.005205738,0.000148605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002408395,0.0003206726,0.9697768,0.02518013,0.00006161031,0.001171085,0.00001650237,0.0000308751,0.001033904],"genre_scores_gemma":[0.4686357,0.0007905673,0.5274283,0.0002550524,0.0001427213,0.0004905454,0.0000146639,0.00002319459,0.002219281],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4908235,"threshold_uncertainty_score":0.6574598,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3811311709820421,"score_gpt":0.4971652540370582,"score_spread":0.1160340830550161,"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."}}