{"id":"W2114003337","doi":"10.1023/b:nets.0000039784.00352.66","title":"A Strategic Model for Dynamic Traffic Assignment","year":2004,"lang":"en","type":"article","venue":"Networks and Spatial Economics","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":42,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Node (physics); Set (abstract data type); Computer science; Traffic flow (computer networking); Flow network; Mathematical optimization; Preference; Order (exchange); Star (game theory); Assignment problem; Operations research; Mathematics; Engineering; Computer network; Economics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"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.001219662,0.001257357,0.001702688,0.001113495,0.001104093,0.002679617,0.0028152,0.003666453,0.01114401],"category_scores_gemma":[0.003602567,0.0009922528,0.001146651,0.002471574,0.001874733,0.003333227,0.00179075,0.00233274,0.001472889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003524254,"about_ca_system_score_gemma":0.003303367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01793324,"about_ca_topic_score_gemma":0.01693306,"domain_scores_codex":[0.9990792,0.0004166458,0.00002940659,0.0001461934,0.0001490062,0.0001795309],"domain_scores_gemma":[0.9990283,0.0005218645,0.0001022337,0.00005520631,0.0001500056,0.0001423448],"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.00002764981,0.00003185103,0.0001989955,0.00004074967,0.00002460417,0.0001093617,0.00006332601,0.5561286,0.0002750061,0.4352715,0.00317266,0.004655683],"study_design_scores_gemma":[0.00002565134,0.00001684952,0.00005420604,0.000007750567,0.00001126236,0.00003599877,0.00003354645,0.8358194,0.00003895608,0.1611782,0.002765745,0.00001255658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02594331,0.000537545,0.9318466,0.002558768,0.000187412,0.0001073621,0.0006641939,0.0001872746,0.03796752],"genre_scores_gemma":[0.8421306,0.001561938,0.1000136,0.0005857509,0.0002497362,0.0004655019,0.000567149,0.0001304827,0.05429523],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01793324,"threshold_uncertainty_score":0.03728044,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02120370495492416,"score_gpt":0.2544721114554223,"score_spread":0.2332684065004981,"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."}}