{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00101595,0.001025437,0.001068786,0.001442997,0.0009819607,0.002212779,0.001954093,0.00133214,0.01769765],"category_scores_gemma":[0.00320306,0.0004765824,0.001038036,0.001636249,0.0008814113,0.003060936,0.003229075,0.002806904,0.006733183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001151763,"about_ca_system_score_gemma":0.001190779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002061888,"about_ca_topic_score_gemma":0.002441933,"domain_scores_codex":[0.998895,0.0002826999,0.0001034915,0.000269555,0.0003609302,0.00008839309],"domain_scores_gemma":[0.9992274,0.0002274633,0.00005884908,0.0001517103,0.0002706087,0.00006395999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001652533,0.000107987,0.0004476454,0.0004175308,0.0000632342,0.0002309269,0.0002363852,0.09529471,0.009089232,0.6424888,0.03751438,0.2139439],"study_design_scores_gemma":[0.00007384757,0.0001031876,0.0002273804,0.00005854992,0.00004488921,0.0002655278,0.00006302672,0.6995477,0.002260211,0.1920665,0.1052322,0.000056989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002443697,0.0004080715,0.9847252,0.0002278263,0.0005638239,0.0001040758,0.0002982345,0.000558791,0.0106702],"genre_scores_gemma":[0.08223642,0.001216372,0.8775169,0.0003649656,0.0007563805,0.000710974,0.001655359,0.0006406261,0.03490207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01769765,"threshold_uncertainty_score":0.05920446,"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."}}