{"id":"W2308115879","doi":"10.1002/atr.1359","title":"Development of realistic shortest path algorithm considering lane changes","year":2015,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Traffic control and management","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Path (computing); Shortest path problem; Computer science; Algorithm; Yen's algorithm; K shortest path routing; Shortest Path Faster Algorithm; Dijkstra's algorithm; Theoretical computer science; Graph; Computer network","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004636096,0.0005440569,0.0006772104,0.0005674985,0.0005623399,0.0007641562,0.001307157,0.0009926528,0.001842762],"category_scores_gemma":[0.00189563,0.0004726713,0.0005642871,0.0006849291,0.000340893,0.00128555,0.0008538695,0.000838873,0.0004007866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006627757,"about_ca_system_score_gemma":0.001827198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007329052,"about_ca_topic_score_gemma":0.004160003,"domain_scores_codex":[0.9996507,0.00007834802,0.00002284672,0.00009006577,0.0001173046,0.00004075269],"domain_scores_gemma":[0.9994222,0.0002053229,0.00006007342,0.00006462965,0.0002144047,0.00003343812],"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.00002358516,0.00002013799,0.0003551175,0.00003516716,0.00001352795,0.00005104568,0.00004435763,0.9408549,0.002193537,0.007958937,0.0008453017,0.04760436],"study_design_scores_gemma":[0.000003685586,0.000006764357,0.00002962142,0.00000156023,0.000001700625,0.00001355292,0.00000534537,0.9979809,0.0002271349,0.001280841,0.0004460019,0.000002934104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0101263,0.00006395338,0.9881746,0.00006906646,0.00002269061,0.00003039865,0.00003002401,0.0002861134,0.001196843],"genre_scores_gemma":[0.3223627,0.0002047221,0.6745316,0.00004455218,0.00003082304,0.0001555534,0.0003125782,0.00007433899,0.002283101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007329052,"threshold_uncertainty_score":0.0145728,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01698139615444752,"score_gpt":0.2244687691235416,"score_spread":0.2074873729690941,"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."}}