{"id":"W2956264009","doi":"10.1061/9780784482292.507","title":"A Bilevel Programming Framework for Determining the Optimal Incentive-Based Traffic Demand Management Strategy","year":2019,"lang":"en","type":"article","venue":"CICTP 2019","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ministry of Education and Child Care","funders":"","keywords":"Incentive; Bilevel optimization; Constraint (computer-aided design); Budget constraint; Computer science; Operations research; Demand management; Set (abstract data type); Linear programming; Variable (mathematics); Mathematical optimization; Microeconomics; Economics; Optimization problem; Engineering; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004064832,0.00008910056,0.00009520429,0.00004829071,0.0003844186,0.0001387179,0.0001893406,0.00008566189,0.00005267896],"category_scores_gemma":[0.00002393238,0.00007155618,0.00006085487,0.0001841404,0.0000685815,0.0001227597,0.000005116171,0.00008552423,0.00003059453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003111652,"about_ca_system_score_gemma":0.00007547122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001540655,"about_ca_topic_score_gemma":0.00003031275,"domain_scores_codex":[0.9991167,0.00005337712,0.0001520833,0.0001984849,0.000210186,0.0002691477],"domain_scores_gemma":[0.9994442,0.0002182811,0.00009542691,0.0001230192,0.00007227005,0.00004682433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0001928335,0.0002547971,0.06840329,0.0001841006,0.0001178118,0.000004335608,0.02260276,0.5941985,0.000007303864,0.06388839,0.001257607,0.2488883],"study_design_scores_gemma":[0.008978866,0.001161149,0.4621768,0.001309961,0.0006054853,6.22364e-7,0.0497726,0.1858733,0.0001779348,0.002655576,0.2849901,0.002297583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7573813,0.00009185862,0.2375241,0.0004305796,0.0005317123,0.001923394,0.00002281515,0.000177225,0.001917029],"genre_scores_gemma":[0.9558149,0.00001100576,0.04292874,0.0001095704,0.00007010522,0.00007022583,0.00005965631,0.00001316946,0.0009226389],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4083251,"threshold_uncertainty_score":0.2956676,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02562748218088755,"score_gpt":0.3106745718011086,"score_spread":0.2850470896202211,"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."}}