{"id":"W4225279627","doi":"10.1155/2022/4124950","title":"Expected Length of the Shortest Path of the Traveling Salesman Problem in 3D Space","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Shortest path problem; Travelling salesman problem; Constrained Shortest Path First; Yen's algorithm; Path length; K shortest path routing; Euclidean shortest path; Mathematical optimization; Path (computing); Any-angle path planning; Longest path problem; Shortest Path Faster Algorithm; Mathematics; Widest path problem; Computer science; Motion planning; Dijkstra's algorithm; Combinatorics; Artificial intelligence; Graph","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.001616897,0.001027499,0.001131674,0.001290129,0.0006551635,0.001504279,0.001563031,0.00119782,0.002614909],"category_scores_gemma":[0.007810751,0.0005656543,0.001326805,0.001448658,0.0007529613,0.002020732,0.0009505865,0.001433568,0.000249713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00216679,"about_ca_system_score_gemma":0.002252843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01940787,"about_ca_topic_score_gemma":0.01173548,"domain_scores_codex":[0.9987822,0.0003578308,0.00007497901,0.0003708447,0.0002480549,0.0001661023],"domain_scores_gemma":[0.9954555,0.003273354,0.0004968986,0.0001415821,0.0004909064,0.0001417507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003611482,0.00002073579,0.001424235,0.00006898169,0.00002543876,0.00004038459,0.00002452598,0.9891194,0.0002065544,0.002630688,0.000387722,0.006015161],"study_design_scores_gemma":[0.000003566802,0.00002543756,0.0004708204,0.000008715325,0.000008895274,0.00002300551,0.00001725136,0.9960228,0.0001608158,0.003050609,0.0002000173,0.000007929069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1887945,0.001318871,0.8017156,0.0006369281,0.00009581579,0.000117596,0.001068999,0.0005143803,0.005737391],"genre_scores_gemma":[0.8794693,0.001034853,0.1134534,0.0001137135,0.0000343319,0.0003710561,0.002150778,0.0001796353,0.003192895],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01940787,"threshold_uncertainty_score":0.03858978,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00833214409765692,"score_gpt":0.2295627017630948,"score_spread":0.2212305576654379,"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."}}