{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001317234,0.0006668828,0.0008072728,0.001350186,0.0004608723,0.000887314,0.001057414,0.0008445269,0.0007494822],"category_scores_gemma":[0.00999896,0.0008690088,0.0004453795,0.001181889,0.0008936385,0.00148949,0.0007957296,0.0006720348,0.0001079013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001760228,"about_ca_system_score_gemma":0.00158434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01564216,"about_ca_topic_score_gemma":0.01217737,"domain_scores_codex":[0.9991835,0.0003131312,0.00003236043,0.0001875464,0.0001900927,0.00009333409],"domain_scores_gemma":[0.9955105,0.003429542,0.0005353498,0.0001271993,0.0002948168,0.0001026967],"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.00001615608,0.000004182457,0.0004743761,0.00001059078,0.000007861861,0.00001467728,0.000009301709,0.9935905,0.0001275113,0.002793848,0.00007944183,0.002871591],"study_design_scores_gemma":[0.000002367472,0.000004816612,0.0002068808,0.000001965285,0.000001520582,0.000007815339,0.000006223015,0.9948597,0.00009522839,0.004714239,0.00009650365,0.000002746746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1109065,0.0001663686,0.8876727,0.0001101378,0.000007917769,0.00003196761,0.0001934721,0.0001444415,0.0007664628],"genre_scores_gemma":[0.8836175,0.0002542837,0.1146682,0.00001640489,0.00001252291,0.00008200792,0.0005193584,0.00004373259,0.0007859704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01564216,"threshold_uncertainty_score":0.03110224,"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."}}