{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000400042,0.0001285286,0.0003061301,0.0001289931,0.000267873,0.00005167159,0.0001076053,0.00009696612,0.0002179003],"category_scores_gemma":[0.0001014241,0.0001413384,0.0001372797,0.0005097729,0.00004839808,0.0007817072,6.082721e-7,0.0002180119,0.000009060256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006626767,"about_ca_system_score_gemma":0.0004614421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003091047,"about_ca_topic_score_gemma":0.0005691547,"domain_scores_codex":[0.9983615,0.0001055218,0.0006430647,0.0001603482,0.0005059124,0.0002236288],"domain_scores_gemma":[0.9982012,0.000186931,0.0004347111,0.00008142556,0.0009378865,0.0001578815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","study_design_scores_codex":[0.0002462424,0.00004637246,0.0001236327,0.00002335341,0.00004734684,0.0001066319,0.03430524,0.9557248,0.007576316,0.0004422985,0.00002066576,0.001337143],"study_design_scores_gemma":[0.113468,0.001693495,0.2491791,0.009612991,0.00768237,0.0006151583,0.4190675,0.03885096,0.05301277,0.01735298,0.0808216,0.008643053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7397229,0.0005660348,0.255331,0.0024582,0.0009129912,0.000211621,0.0000276412,0.0001056243,0.0006640119],"genre_scores_gemma":[0.935064,0.0001373694,0.06413118,0.0002180353,0.000174038,0.000002896283,0.00008317662,0.00002200797,0.0001673284],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9168738,"threshold_uncertainty_score":0.5763613,"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."}}