{"id":"W2010342401","doi":"10.1080/13658810601079759","title":"A shortest path algorithm with novel heuristics for dynamic transportation networks","year":2007,"lang":"en","type":"article","venue":"International Journal of Geographical Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"ca_institutions":"MRF Geosystems (Canada)","funders":"","keywords":"Heuristics; Computer science; Shortest path problem; Path (computing); Process (computing); Yen's algorithm; Algorithm; Object (grammar); Mathematical optimization; Dijkstra's algorithm; K shortest path routing; Artificial intelligence; Theoretical computer science; Mathematics","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.0004788022,0.0006469418,0.0005995896,0.001218075,0.0006556151,0.0008414704,0.001235188,0.0008185811,0.001196219],"category_scores_gemma":[0.002080025,0.0004055237,0.0005412901,0.001864277,0.0004167093,0.001399057,0.000715455,0.0007839253,0.0003807579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005923217,"about_ca_system_score_gemma":0.001585383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006446355,"about_ca_topic_score_gemma":0.005641946,"domain_scores_codex":[0.9997136,0.00008851903,0.00002182491,0.00006607311,0.00007619183,0.00003378059],"domain_scores_gemma":[0.9993275,0.0003905765,0.00006876639,0.00006872988,0.0001008387,0.00004365184],"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.0001497724,0.0002066849,0.0009393942,0.0001727966,0.00009183611,0.0001609587,0.000101693,0.6148089,0.00541565,0.02738705,0.00778287,0.3427824],"study_design_scores_gemma":[0.00004297613,0.00008587218,0.0001817335,0.000009031254,0.00001859374,0.0001288543,0.00002848367,0.9841766,0.001351494,0.008791404,0.005164773,0.0000200579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01351696,0.0003993588,0.9828759,0.0001146499,0.00007879775,0.00009378594,0.00009550153,0.001091134,0.001733852],"genre_scores_gemma":[0.1269031,0.0003182457,0.8707378,0.00006708779,0.00003822226,0.0001797812,0.0003078808,0.00008823739,0.001359685],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006446355,"threshold_uncertainty_score":0.01281768,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007295755120132437,"score_gpt":0.2433534698424764,"score_spread":0.236057714722344,"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."}}