{"id":"W1956400035","doi":"10.1002/atr.1313","title":"Solving the stochastic multi‐class traffic assignment problem with asymmetric interactions, route overlapping, and vehicle restrictions","year":2015,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Research Foundation of Korea","keywords":"Computer science; Path (computing); Mathematical optimization; Logit; Sensitivity (control systems); Class (philosophy); Scheme (mathematics); Algorithm; Mathematics; Engineering; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":true,"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.0008129366,0.0005603713,0.0007417201,0.0004381285,0.0004718751,0.0005867855,0.001320016,0.0008701502,0.003008977],"category_scores_gemma":[0.001903417,0.0003877122,0.0006491746,0.0005910142,0.0004786418,0.0007768639,0.000966606,0.0007140243,0.0001833994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008384016,"about_ca_system_score_gemma":0.001892913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01469583,"about_ca_topic_score_gemma":0.01138187,"domain_scores_codex":[0.9995338,0.0001629475,0.00001968142,0.0001062315,0.00009349235,0.00008386965],"domain_scores_gemma":[0.9991229,0.000527397,0.00009461417,0.00006949093,0.0001313049,0.00005438356],"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.00001614125,0.00001709144,0.0003438114,0.00001449061,0.00000955038,0.00002417586,0.00001273111,0.9845621,0.0002786421,0.003045925,0.0002263994,0.01144894],"study_design_scores_gemma":[0.000004866899,0.000005930818,0.00004499534,6.877439e-7,0.000001648304,0.000004986097,0.000003936395,0.9987358,0.0001006182,0.001003261,0.00009195573,0.000001345884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06392314,0.00004886504,0.9330653,0.0001227488,0.00001825347,0.0000708671,0.00004804877,0.000215878,0.002486827],"genre_scores_gemma":[0.6560265,0.00006521563,0.3406594,0.00007509839,0.00001926087,0.0002076604,0.0001745226,0.00006503354,0.002707302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01469583,"threshold_uncertainty_score":0.02922058,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0221491365394115,"score_gpt":0.2863930781599848,"score_spread":0.2642439416205733,"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."}}