{"id":"W2742575432","doi":"10.1155/2017/1624328","title":"Analysis of an Automated Vehicle Routing Problem in Logistics considering Path Interruption","year":2017,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Government of Jiangsu Province; Jiangsu Science and Technology Department; National Natural Science Foundation of China","keywords":"Vehicle routing problem; Path (computing); Computer science; Routing (electronic design automation); Particle swarm optimization; Operations research; Automated guided vehicle; Shortest path problem; Transport engineering; Real-time computing; Simulation; Engineering; Embedded system; Algorithm; Artificial intelligence; Computer network","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.000550058,0.00009557007,0.0003274802,0.0003356615,0.00005085688,0.00003042604,0.000134715,0.00006167428,0.00000550025],"category_scores_gemma":[0.000118104,0.0001014768,0.00008442778,0.0002642485,0.00002916999,0.000683476,0.000002099353,0.0001639951,1.397362e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006594021,"about_ca_system_score_gemma":0.00002022677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001505223,"about_ca_topic_score_gemma":0.0001363501,"domain_scores_codex":[0.9987996,0.00004141194,0.0007838947,0.00008634829,0.0001676435,0.0001210984],"domain_scores_gemma":[0.9988794,0.0000550618,0.0006619041,0.0001655775,0.0001913716,0.00004665448],"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.00002852823,0.00002477447,0.03643093,0.00004192531,0.0001061366,0.00001616594,0.00150017,0.9349127,0.01971645,0.00004520485,2.586651e-7,0.007176738],"study_design_scores_gemma":[0.0004495028,0.00004049395,0.4044499,0.0001013744,0.0001524984,0.00000138588,0.0002524634,0.5921082,0.002315702,0.0000613694,0.000001798973,0.00006532802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7980179,0.00002155084,0.201675,0.00001092084,0.0001138913,0.00005627295,0.000006940741,0.00006271782,0.00003487219],"genre_scores_gemma":[0.8066547,0.0000308439,0.1932666,0.000002698456,0.00001507606,9.957839e-7,0.00001398622,0.00001427138,8.788729e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3680189,"threshold_uncertainty_score":0.4138103,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02914794187776311,"score_gpt":0.3328399934942757,"score_spread":0.3036920516165126,"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."}}