{"id":"W2440655608","doi":"","title":"Modeling And Optimizing Route Choice For Multimodal Transportation Networks","year":2016,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Transport engineering; Traffic congestion; Computer science; Schedule; Routing (electronic design automation); Probabilistic logic; Vehicle routing problem; Flow network; Dijkstra's algorithm; Operations research; Shortest path problem; Graph; Engineering; Computer network; Mathematical optimization","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.001042842,0.001226084,0.001148899,0.00115574,0.0006161871,0.001468409,0.001590104,0.001729974,0.00479962],"category_scores_gemma":[0.002356011,0.0008252422,0.001413381,0.001360715,0.0008159871,0.001292098,0.000973126,0.001250294,0.0003813459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003109104,"about_ca_system_score_gemma":0.002074452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.04472717,"about_ca_topic_score_gemma":0.0340918,"domain_scores_codex":[0.999414,0.0002671075,0.00001919608,0.0001349767,0.00006530045,0.0000994744],"domain_scores_gemma":[0.9992341,0.0004647747,0.0001173058,0.00002665675,0.0001070972,0.00005003424],"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.000005375255,0.000006724973,0.0001812104,0.000009436386,0.000008429191,0.00001105502,0.000008544159,0.9960545,0.00005232355,0.002536678,0.0001002832,0.001025324],"study_design_scores_gemma":[0.000001322,0.0000045768,0.00004710625,0.000001713639,0.000002748253,0.000001715264,0.000006364143,0.9985548,0.00001708425,0.001210781,0.0001502424,0.000001584438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1253727,0.001314276,0.8560485,0.000928852,0.0001095805,0.0001941836,0.0009830426,0.0003722895,0.01467665],"genre_scores_gemma":[0.8945578,0.001149639,0.08472748,0.00009765886,0.00007088117,0.0004651527,0.0007457033,0.0001176109,0.01806795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04472717,"threshold_uncertainty_score":0.08893365,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02986192293764968,"score_gpt":0.3072234006994945,"score_spread":0.2773614777618448,"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."}}