{"id":"W4297769474","doi":"10.5267/j.dsl.2022.6.003","title":"An efficient hybrid genetic algorithm for solving truncated travelling salesman problem","year":2022,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Travelling salesman problem; Tree traversal; Genetic algorithm; Heuristic; Mathematical optimization; Christofides algorithm; Computer science; 2-opt; Lin–Kernighan heuristic; Bottleneck traveling salesman problem; Metaheuristic; Algorithm; Selection (genetic algorithm); Mathematics; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002473338,0.0000973788,0.0001104621,0.0003353239,0.003479953,0.0002586806,0.0006667131,0.00001852974,0.00007015523],"category_scores_gemma":[0.00007220545,0.0001022774,0.00005484243,0.001133205,0.0002695916,0.0002562425,0.00001934459,0.0001124893,0.000005687869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001702535,"about_ca_system_score_gemma":0.0002219026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001054832,"about_ca_topic_score_gemma":0.00001433456,"domain_scores_codex":[0.9974372,0.00006967509,0.0002959489,0.0005030232,0.001245434,0.0004487586],"domain_scores_gemma":[0.9991825,0.00020515,0.0001275719,0.0001906878,0.0001249489,0.0001691504],"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.00001311969,0.00005136751,0.000506273,0.000001398193,0.000001874166,0.000008388925,0.008961431,0.8880645,0.005168308,0.000318775,0.0003431748,0.09656139],"study_design_scores_gemma":[0.0005704472,0.0001062299,0.006686902,0.00001647195,0.00001504618,0.000005617275,0.004068137,0.9796512,0.000785106,0.00048108,0.00729063,0.000323178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4518642,0.000009552239,0.5468297,0.0005301026,0.0003483427,0.0002712842,0.00001507112,0.00007387438,0.00005791561],"genre_scores_gemma":[0.7647275,0.000003288516,0.2342382,0.0008533678,0.00006543709,0.00005577252,0.00002340004,0.00001084165,0.00002228294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3128633,"threshold_uncertainty_score":0.9978174,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01925898632065237,"score_gpt":0.3016121113861703,"score_spread":0.2823531250655179,"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."}}