{"id":"W2543705200","doi":"10.1109/vnis.1995.518839","title":"Estimation of expected minimum paths in dynamic and stochastic traffic networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Shortest path problem; Computer science; Mathematical optimization; Heuristic; Path (computing); K shortest path routing; Computation; Constrained Shortest Path First; Yen's algorithm; Shortest Path Faster Algorithm; Floyd–Warshall algorithm; Longest path problem; Dijkstra's algorithm; Algorithm; Mathematics; Graph; Theoretical computer science","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.00009165702,0.00003482086,0.00006188469,0.00006206403,0.00005340302,0.000010562,0.00002711604,0.00004753282,0.0001017043],"category_scores_gemma":[0.00003825137,0.00003547149,0.000008684107,0.0002139134,0.00005129665,0.00008719212,9.57185e-7,0.00003219159,0.000001249882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001244806,"about_ca_system_score_gemma":0.000007640738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001030889,"about_ca_topic_score_gemma":0.001243222,"domain_scores_codex":[0.9995956,0.00003160993,0.0001281505,0.00007510577,0.00008759231,0.00008188831],"domain_scores_gemma":[0.9998168,0.00006994471,0.00003930987,0.00002972244,0.00001799288,0.00002620123],"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.000003141321,0.00002286382,0.0005099009,0.000002533106,0.000001252755,4.888252e-7,0.01186615,0.9723095,0.000001846703,0.0004499549,0.00002972165,0.01480265],"study_design_scores_gemma":[0.0001769199,0.00001268589,0.012062,0.00001601205,0.000003692745,1.144064e-7,0.001696397,0.9859577,3.528262e-7,0.00002843287,0.000004089242,0.00004154431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8730814,0.0001436643,0.1252127,0.0001510407,0.00005478346,0.000111273,0.00000121302,0.00005258666,0.001191281],"genre_scores_gemma":[0.9983078,0.00003417588,0.001366879,0.00001042325,0.00000561513,0.000003511106,0.0000113346,0.000002702716,0.0002575355],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1252264,"threshold_uncertainty_score":0.1446485,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01152221752249685,"score_gpt":0.2545975614434677,"score_spread":0.2430753439209709,"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."}}