{"id":"W2621038882","doi":"10.1007/978-3-319-60042-0_6","title":"A New System for the Dynamic Shortest Route Problem","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Shortest path problem; K shortest path routing; Constrained Shortest Path First; Computer science; Private Network-to-Network Interface; Mathematical optimization; Routing (electronic design automation); Shortest Path Faster Algorithm; Vehicle routing problem; Link-state routing protocol; Theoretical computer science; Mathematics; Computer network; Routing protocol; Graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008179034,0.0003426079,0.0003445353,0.0001964007,0.0003222956,0.0004334131,0.001559599,0.0002310403,0.00000548116],"category_scores_gemma":[0.00007307797,0.0002634119,0.00009982739,0.00009559898,0.0001793178,0.0001491803,0.0002104023,0.0004551292,0.000008635921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003806502,"about_ca_system_score_gemma":0.0002388109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001601184,"about_ca_topic_score_gemma":0.00009405971,"domain_scores_codex":[0.99839,0.00001132902,0.0003231377,0.0005315977,0.0003425267,0.0004014769],"domain_scores_gemma":[0.9981039,0.0005817394,0.000138418,0.0009792013,0.0001067171,0.00009002334],"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.00000107417,6.467648e-7,0.000007062702,0.00006386405,0.00001010799,0.000002677449,0.0001029108,0.6644559,0.00002345467,0.0006819835,0.00001298669,0.3346373],"study_design_scores_gemma":[0.0001403323,0.00002399019,0.00003406797,0.0004952939,0.00002257805,0.00003027233,1.322839e-7,0.993437,0.0001245187,0.003712303,0.00167584,0.0003036704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000002717951,0.0005293451,0.99333,0.0001979083,0.001859484,0.0007328871,0.00001165037,0.000315717,0.003020275],"genre_scores_gemma":[0.03906413,0.00002652386,0.95917,0.00006333741,0.0005020169,0.0000223592,0.000005879805,0.0000871106,0.001058661],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3343337,"threshold_uncertainty_score":0.9999818,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01740690741402428,"score_gpt":0.2623821747231629,"score_spread":0.2449752673091387,"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."}}