{"id":"W3171114511","doi":"10.5267/j.jpm.2021.5.002","title":"Solving open travelling salesman subset-tour problem through a hybrid genetic algorithm","year":2021,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Travelling salesman problem; Tree traversal; Crossover; Christofides algorithm; Benchmark (surveying); 2-opt; Computer science; Selection (genetic algorithm); Genetic algorithm; Traverse; Set (abstract data type); Bottleneck traveling salesman problem; Lin–Kernighan heuristic; Nearest neighbour algorithm; Mathematical optimization; Mutation; Permutation (music); Algorithm; Mathematics; Artificial intelligence; Machine learning; Geography; Biology","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003473955,0.0006060682,0.0007973885,0.0007310295,0.0004185602,0.0007510526,0.00104242,0.0008197036,0.001449233],"category_scores_gemma":[0.0006855348,0.0003210978,0.000779443,0.0008583193,0.0003365302,0.0005944088,0.0005961404,0.0004766054,0.0001792268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004968002,"about_ca_system_score_gemma":0.001046863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006919732,"about_ca_topic_score_gemma":0.00478004,"domain_scores_codex":[0.9997379,0.00006693281,0.00001130384,0.00005160879,0.00008156011,0.00005063439],"domain_scores_gemma":[0.9998103,0.00008900335,0.00002278934,0.00001466389,0.00004608238,0.00001720409],"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.00005491976,0.00007477255,0.0008908387,0.00005544582,0.00006601984,0.0001081666,0.00007127359,0.9170251,0.002673402,0.006929716,0.001226941,0.0708234],"study_design_scores_gemma":[0.00001108747,0.00003283008,0.0001167599,0.000005029847,0.0000122326,0.00003519709,0.00001676881,0.9975084,0.0003433761,0.001279623,0.0006342837,0.000004314106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08439012,0.0005227348,0.9066107,0.0002161571,0.00006840036,0.0001140311,0.00007489948,0.0005525273,0.007450389],"genre_scores_gemma":[0.6217559,0.0004921142,0.3718002,0.0001625508,0.0000415998,0.0002641669,0.0002761935,0.00007826743,0.005129055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006919732,"threshold_uncertainty_score":0.01375896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03150600752234208,"score_gpt":0.2963904838218729,"score_spread":0.2648844762995309,"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."}}