{"id":"W2070583489","doi":"10.1016/j.cor.2013.06.013","title":"Rapid transit network design for optimal cost and origin–destination demand capture","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Computer science; Mathematical optimization; Graph; Vertex (graph theory); Transit (satellite); Network planning and design; Transit time; Integer (computer science); Travel time; Integer programming; Transit system; Graph theory; Operations research; Algorithm; Public transport; Theoretical computer science; Mathematics; Transport engineering; Combinatorics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001078132,0.001183304,0.000991272,0.000954547,0.000513228,0.001078587,0.001158752,0.001376444,0.009062652],"category_scores_gemma":[0.002692385,0.0009478241,0.0008425561,0.0009743311,0.0004943185,0.001170437,0.000866125,0.000673556,0.0006754227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001906395,"about_ca_system_score_gemma":0.001910896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007023069,"about_ca_topic_score_gemma":0.006434226,"domain_scores_codex":[0.9995304,0.0001850239,0.0000115157,0.00008794213,0.0001007662,0.00008428004],"domain_scores_gemma":[0.999257,0.0003868848,0.00008398303,0.00002802842,0.0002134276,0.00003058322],"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.00003351488,0.00001821073,0.00008127469,0.00004073332,0.000009433825,0.00002682763,0.00002264752,0.9853241,0.001110894,0.007828652,0.0006090184,0.004894741],"study_design_scores_gemma":[0.000008518417,0.00003035367,0.00004519567,0.000004542553,0.000007412965,0.00001073054,0.00001209864,0.996792,0.0003561999,0.00215648,0.0005717817,0.000004582558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03586677,0.0001653754,0.9453846,0.0002501227,0.00005413386,0.0002100453,0.0002368869,0.0001942087,0.01763784],"genre_scores_gemma":[0.8331749,0.0003726528,0.1464161,0.0001131905,0.00005913145,0.0004979923,0.0002969791,0.0002087167,0.01886026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009062652,"threshold_uncertainty_score":0.0303176,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1027564940145313,"score_gpt":0.3781683368488936,"score_spread":0.2754118428343624,"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."}}