{"id":"W2103428304","doi":"10.1002/atr.5670390107","title":"Modeling the bilateral micro-searching behavior for urban taxi services using the absorbing markov chain approach","year":2005,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Croucher Foundation","keywords":"Taxis; Markov chain; Queueing theory; Computer science; Set (abstract data type); Logit; Mathematical optimization; Operations research; Markov model; Markov process; Point (geometry); Chain (unit); Transport engineering; Mathematics; Engineering; Computer network; Machine learning; Statistics","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.0009664062,0.0005304544,0.000736056,0.0008535941,0.0007305434,0.00149648,0.001668855,0.001295078,0.005654431],"category_scores_gemma":[0.00308744,0.0006302572,0.0009502464,0.001087685,0.0009228877,0.002275539,0.0009073379,0.001086574,0.0004614853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00216539,"about_ca_system_score_gemma":0.002349724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02884655,"about_ca_topic_score_gemma":0.02265555,"domain_scores_codex":[0.9995015,0.000172672,0.00001972782,0.00008763577,0.00007327439,0.0001451976],"domain_scores_gemma":[0.9982353,0.001130124,0.0003181189,0.00005946245,0.0001434102,0.0001136061],"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.0000184613,0.00004227615,0.001518322,0.00002052742,0.00002219215,0.0001124268,0.00007413302,0.9257841,0.0003770518,0.06964032,0.0003603311,0.002029906],"study_design_scores_gemma":[0.00000363865,0.000005372521,0.0001351581,0.00000227894,0.00000569613,0.0000113351,0.00001528781,0.9942452,0.00004340144,0.005386293,0.0001423743,0.000003840787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.18607,0.0002827214,0.8000944,0.001006611,0.000052148,0.0001047617,0.0004331851,0.000236821,0.01171929],"genre_scores_gemma":[0.958062,0.0005282895,0.03130296,0.0000772488,0.00004206382,0.0001842916,0.0001999555,0.00004951152,0.009553748],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02884655,"threshold_uncertainty_score":0.05735731,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0183701535905697,"score_gpt":0.2644432899934008,"score_spread":0.2460731364028311,"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."}}