{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132692,0.0001312025,0.0001823535,0.0005622077,0.00006505796,0.0005285217,0.0008810156,0.00006847645,0.000001291578],"category_scores_gemma":[0.00002763062,0.0001023565,0.0001196985,0.0003835444,0.00003964318,0.002994156,0.00002565175,0.0001677312,0.000001646663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000482639,"about_ca_system_score_gemma":0.00003827648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000178221,"about_ca_topic_score_gemma":0.000008736007,"domain_scores_codex":[0.9978664,0.00001078008,0.0009652195,0.0001011712,0.0008531038,0.0002033177],"domain_scores_gemma":[0.9974645,0.0001347093,0.0007749897,0.0001459796,0.001366314,0.000113516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005360306,0.0006340458,0.007637694,0.00009865034,0.001490186,0.0001438927,0.001248185,0.08311204,0.000041316,0.2241549,0.002523779,0.6783792],"study_design_scores_gemma":[0.00167535,0.0003362386,0.01432316,0.0001418626,0.00003263214,0.0001776413,0.0002417399,0.9446917,0.000006356968,0.0001934782,0.03797676,0.0002030524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001033639,0.00005104262,0.9962364,0.0002679429,0.001916517,0.000234178,0.0001079573,0.00003735425,0.0001149299],"genre_scores_gemma":[0.8882428,0.00005499391,0.1108124,0.0002641257,0.0003250289,0.00001025126,0.0002649839,0.000007756958,0.00001767752],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8872091,"threshold_uncertainty_score":0.5096546,"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."}}