{"id":"W1987093621","doi":"10.1002/atr.5670400207","title":"The optimal dispatching of taxis under congestion: A rolling horizon approach","year":2006,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Croucher Foundation","keywords":"Taxis; Computer science; Heuristics; Predictability; Anticipation (artificial intelligence); Traffic congestion; Transport engineering; Operations research; Time horizon; Truck; Rush hour; Public transport; Engineering; Mathematical optimization; Automotive engineering; Mathematics; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000192703,0.00009971815,0.0001604583,0.00008615694,0.00008182287,0.00001461908,0.00008694923,0.00004733885,0.000004374809],"category_scores_gemma":[0.000006193662,0.00007997622,0.0001001085,0.0002596804,0.00004212753,0.0003229021,3.251065e-7,0.0001892244,3.043641e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003270734,"about_ca_system_score_gemma":0.00002765716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000900026,"about_ca_topic_score_gemma":0.000100619,"domain_scores_codex":[0.9988568,0.00001075846,0.0007136338,0.00006651127,0.0002361764,0.0001160729],"domain_scores_gemma":[0.9993337,0.00006840133,0.0002392141,0.00008640028,0.0002434964,0.00002872944],"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.00004836339,0.00003816388,0.0007459911,0.00003611974,0.0000349905,0.00000148166,0.000364314,0.9773291,0.00977258,0.007968146,0.00001526385,0.003645486],"study_design_scores_gemma":[0.002567127,0.0003062772,0.9659696,0.000160323,0.0002144807,0.00001818794,0.004028647,0.008170102,0.01131338,0.003788223,0.003107169,0.0003565425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7069388,0.0003087567,0.2921745,0.00007805957,0.000242943,0.00008868325,0.00001269082,0.00002776866,0.0001277674],"genre_scores_gemma":[0.9814629,0.0001185342,0.01824629,0.000004866308,0.00008066466,0.000006461722,0.00005014276,0.00001572382,0.00001441662],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.969159,"threshold_uncertainty_score":0.3261336,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006581190497613161,"score_gpt":0.2156301694494897,"score_spread":0.2090489789518766,"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."}}