{"id":"W4200396793","doi":"10.1155/2021/3207025","title":"Optimizing Customized Transit Service considering Stochastic Bus Arrival Time","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Young Scientists Fund; Education Department of Shaanxi Province; Natural Science Foundation of Shaanxi Province","keywords":"Probabilistic logic; Service (business); Arrival time; Bus rapid transit; Genetic algorithm; Computer science; Heuristic; Routing (electronic design automation); Operations research; Vehicle routing problem; Mathematical optimization; Transport engineering; Public transport; Engineering; Computer network; Mathematics","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.0006849673,0.001101718,0.001007677,0.0006025691,0.0004516861,0.0009768286,0.0008266947,0.001042831,0.001497142],"category_scores_gemma":[0.001254304,0.0005973806,0.0009018218,0.000961943,0.0005514611,0.0007368216,0.0007077708,0.0007108245,0.0001102195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001930472,"about_ca_system_score_gemma":0.00273568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03527668,"about_ca_topic_score_gemma":0.02259866,"domain_scores_codex":[0.9995496,0.0001418399,0.00001704657,0.00008389785,0.00006364207,0.0001440554],"domain_scores_gemma":[0.9994991,0.0002284108,0.00009862296,0.00002179211,0.00008619177,0.00006594903],"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.00001180939,0.000007765064,0.0002333837,0.000008147408,0.000005854869,0.00002147746,0.000004813425,0.9980668,0.0001998862,0.0005686544,0.00006601356,0.0008054523],"study_design_scores_gemma":[0.000002767524,0.00001291678,0.0001112487,7.507203e-7,0.00000392162,0.000004193872,0.000007246803,0.9995093,0.00005513132,0.0002432738,0.00004760428,0.000001610208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5156743,0.0005028459,0.4733173,0.0005451051,0.00009023767,0.0001527729,0.000476514,0.0003518748,0.008889015],"genre_scores_gemma":[0.9873936,0.0001450486,0.01064641,0.00002100254,0.00001034383,0.00005289805,0.0001148575,0.00002588446,0.00158986],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03527668,"threshold_uncertainty_score":0.07014269,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01384991782021103,"score_gpt":0.271349197949878,"score_spread":0.2574992801296669,"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."}}