{"id":"W4253771444","doi":"10.1109/glocom.2014.7417469","title":"A Public Vehicle System with Multiple Origin-Destination Pairs on Traffic Networks","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Taxis; Public transport; Computer science; Traffic congestion; Scheduling (production processes); Travelling salesman problem; Key (lock); Path (computing); Energy consumption; Traffic system; Transport engineering; Real-time computing; Computer network; Mathematical optimization; Engineering; Computer security","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.0004778757,0.0009930842,0.001306035,0.0006650713,0.002258902,0.001713064,0.002102302,0.001881409,0.009586281],"category_scores_gemma":[0.001197406,0.0004224046,0.0006487531,0.001549334,0.0009504429,0.002089744,0.002163432,0.000874729,0.0008723335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002567234,"about_ca_system_score_gemma":0.001417754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01542981,"about_ca_topic_score_gemma":0.01142883,"domain_scores_codex":[0.9992078,0.0001833745,0.00002701072,0.000213889,0.0001092424,0.0002587203],"domain_scores_gemma":[0.9993473,0.0002465937,0.00009138954,0.00006338639,0.0001331083,0.0001182678],"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.0005511308,0.0001666608,0.003139293,0.0001249436,0.00008282606,0.001392384,0.0001569068,0.9448487,0.003033641,0.02843294,0.003906807,0.01416395],"study_design_scores_gemma":[0.00004312504,0.00009079731,0.0003646417,0.000004548407,0.00002407691,0.0001164586,0.00008396529,0.9914188,0.0004099348,0.005798196,0.001628642,0.00001682186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7491322,0.0005993374,0.2161126,0.001876836,0.0003466764,0.0003753392,0.001510127,0.001052741,0.02899413],"genre_scores_gemma":[0.9855192,0.0001799598,0.00552859,0.0000515317,0.00004634708,0.0001010143,0.0002956663,0.0000181275,0.00825948],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01542981,"threshold_uncertainty_score":0.03206927,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05761607196773316,"score_gpt":0.2602072905555159,"score_spread":0.2025912185877827,"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."}}