{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003966516,0.0000802168,0.0001847535,0.00007180628,0.00004878457,0.0000026171,0.0001901716,0.0000257326,0.00001285],"category_scores_gemma":[0.00003341626,0.00005951824,0.00009691732,0.0005521174,0.00002193202,0.0001185062,0.000003747985,0.0003262588,2.362996e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000682895,"about_ca_system_score_gemma":0.00004800837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000440344,"about_ca_topic_score_gemma":0.00003202567,"domain_scores_codex":[0.998791,0.00009980347,0.000631177,0.00006138267,0.0003210353,0.00009554456],"domain_scores_gemma":[0.9992833,0.00007194136,0.0004047515,0.0001229602,0.00009920781,0.00001788639],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0000247694,0.00003115542,0.01578073,0.0000337224,0.00001539638,0.000001538064,0.004694718,0.9356295,0.04224282,0.00008494387,0.000002153864,0.001458501],"study_design_scores_gemma":[0.001714665,0.0001296285,0.9071978,0.0003370306,0.000087778,0.00001623251,0.00424994,0.0478906,0.03768472,0.0003766154,0.0001380245,0.0001769442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.974749,0.000140668,0.02451777,0.00008244783,0.0002604445,0.0001700425,0.00001200626,0.00001216225,0.00005548491],"genre_scores_gemma":[0.9396331,0.00003786611,0.0602745,0.000005813843,0.00001525378,0.000004524566,0.000002469476,0.00001914379,0.000007283694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8914171,"threshold_uncertainty_score":0.2427083,"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."}}