{"id":"W2154889564","doi":"10.3141/2498-01","title":"Heuristic Approach to Capacitated Traffic Assignment Problem for Large-Scale Transport Networks","year":2015,"lang":"en","type":"article","venue":"Transportation Research Record Journal of the Transportation Research Board","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Göteborgs Universitet; Chalmers Tekniska Högskola","keywords":"Mathematical optimization; Heuristic; Benchmark (surveying); Computer science; Convergence (economics); Reliability (semiconductor); Flow network; Scale (ratio); Traffic flow (computer networking); Sensitivity (control systems); Operations research; Mathematics; Engineering; Economics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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.001144193,0.0008466919,0.000897009,0.001366407,0.0006945384,0.001130235,0.001540756,0.001205523,0.0031955],"category_scores_gemma":[0.002123767,0.000459207,0.000745404,0.001601204,0.0006411835,0.0007702888,0.0006899465,0.0009912536,0.0002615419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001553734,"about_ca_system_score_gemma":0.001941422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008950428,"about_ca_topic_score_gemma":0.009004757,"domain_scores_codex":[0.9994886,0.0002723607,0.00001683673,0.0000649298,0.00008575706,0.00007153628],"domain_scores_gemma":[0.9989867,0.0007078736,0.00008787141,0.0000374078,0.0001151064,0.00006496674],"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.00001700706,0.00002012102,0.0001459225,0.00004770912,0.00001307366,0.00003585984,0.00001918219,0.9857648,0.0001263741,0.005420217,0.0005969026,0.007792799],"study_design_scores_gemma":[0.000004714622,0.000008583021,0.00002409032,0.000004533709,0.000002966934,0.0000072704,0.00001067252,0.9970301,0.00005681382,0.002569714,0.0002784738,0.000002024907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02214705,0.0006074669,0.9700674,0.0003347006,0.00006001369,0.0001596941,0.00009274331,0.0002104182,0.006320486],"genre_scores_gemma":[0.593607,0.0007567724,0.4004633,0.0001306619,0.000110523,0.000504575,0.000254711,0.00008403899,0.004088432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008950428,"threshold_uncertainty_score":0.0177967,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1203028024472339,"score_gpt":0.3881356518612334,"score_spread":0.2678328494139995,"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."}}