{"id":"W2157686634","doi":"10.1002/atr.5670350204","title":"A bi‐level programming approach — Optimal transit fare under line capacity constraints","year":2001,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Transit (satellite); Heuristic; Flow network; Public transport; Computer science; Line (geometry); Sensitivity (control systems); Network planning and design; Mathematical optimization; Transport engineering; Programming paradigm; Integer programming; Linear programming; Transit system; Operations research; Engineering; Computer network; Mathematics; Algorithm","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"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.002293961,0.001343834,0.00177669,0.001186418,0.0006804989,0.002594226,0.001392956,0.00199763,0.005664134],"category_scores_gemma":[0.003968453,0.001375359,0.001076125,0.001592069,0.001038057,0.001911454,0.00136337,0.002171814,0.0004814214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002369929,"about_ca_system_score_gemma":0.002706293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009726964,"about_ca_topic_score_gemma":0.004504739,"domain_scores_codex":[0.9988267,0.0006284935,0.0000296756,0.0001412603,0.0002207872,0.0001531406],"domain_scores_gemma":[0.998638,0.0009826267,0.00008404852,0.00003592084,0.0001872732,0.00007220464],"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.00001452082,0.00001552233,0.00004883868,0.00002578246,0.00001047131,0.00001786841,0.00001305766,0.9898257,0.0002168583,0.007596943,0.0002295282,0.001984936],"study_design_scores_gemma":[0.000004337701,0.000007912482,0.00001459772,0.000003406376,0.00000253186,0.000002168244,0.000004600326,0.9974061,0.00006120358,0.002364284,0.000126552,0.000002365363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01254467,0.0002333643,0.9798353,0.0003872962,0.00004888401,0.00008044521,0.0001295604,0.0001222957,0.006618279],"genre_scores_gemma":[0.6787893,0.0007664567,0.3103634,0.0002722017,0.0001004152,0.0006750202,0.0002738146,0.0002059697,0.008553371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009726964,"threshold_uncertainty_score":0.01934069,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04792166520528408,"score_gpt":0.3016636375152281,"score_spread":0.2537419723099441,"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."}}