{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002107792,0.001136877,0.002381222,0.0009622254,0.000599511,0.001638273,0.001219143,0.001447919,0.004108249],"category_scores_gemma":[0.003671225,0.001072851,0.0007913562,0.001083927,0.0008715392,0.001161725,0.0007058908,0.001188936,0.0002860272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001866317,"about_ca_system_score_gemma":0.00184274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02569612,"about_ca_topic_score_gemma":0.01035442,"domain_scores_codex":[0.9992499,0.0003586859,0.00002517523,0.0001009805,0.00009927242,0.0001660985],"domain_scores_gemma":[0.9982756,0.001198246,0.000157767,0.00003899465,0.0001609078,0.0001683983],"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.00003133521,0.00001000311,0.0000587152,0.00001428571,0.00000929059,0.00001803548,0.000006788097,0.9973003,0.00007915602,0.0008473163,0.0001462917,0.001478451],"study_design_scores_gemma":[0.000005607607,0.00001314028,0.00004004426,0.00000216502,0.000003588721,0.000001444838,0.000005552121,0.9991986,0.00003218107,0.0006411702,0.00005365402,0.000002816331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1702499,0.001575662,0.8108248,0.0009316248,0.000198198,0.0002803243,0.000591794,0.0006884084,0.01465922],"genre_scores_gemma":[0.9460792,0.0004158811,0.04971687,0.00008951285,0.00004939052,0.0001535667,0.0002858287,0.00007487335,0.003134911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02569612,"threshold_uncertainty_score":0.0510931,"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."}}