{"id":"W2141125834","doi":"10.1002/atr.5670340207","title":"Optimal scheduling of public transport fleet at network level","year":2000,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Public transport; Operator (biology); TRIPS architecture; Computer science; Operations research; Mathematical optimization; Dynamic programming; Routing (electronic design automation); Service (business); Vehicle routing problem; Fleet management; Transport engineering; Engineering; Computer network; Telecommunications; Mathematics; Economics","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.0002541293,0.0001580534,0.00031085,0.0001434648,0.00006116659,0.000006005404,0.0001274257,0.00008878179,0.0005600654],"category_scores_gemma":[0.000005093552,0.00016465,0.0001800542,0.0004985612,0.0000476343,0.000598019,2.766249e-7,0.0002152888,0.000004644155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005826604,"about_ca_system_score_gemma":0.00005557291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002433951,"about_ca_topic_score_gemma":0.0001687268,"domain_scores_codex":[0.9982267,0.00001202444,0.00110407,0.0001064375,0.0003188652,0.0002319054],"domain_scores_gemma":[0.9992366,0.00003392556,0.000209861,0.0001267916,0.0002862296,0.0001066212],"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.00009288418,0.00005274968,0.00615016,0.0000647106,0.00008526129,0.00000868422,0.0009984105,0.9698263,0.00775993,0.0004970189,0.00003086624,0.01443302],"study_design_scores_gemma":[0.002308347,0.0001762534,0.9767465,0.0001653902,0.0001600148,0.00002046033,0.0003359251,0.001167195,0.007022523,0.0003326715,0.01123414,0.0003305518],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9454753,0.0003006045,0.05329532,0.00009169022,0.0003058628,0.0001204656,0.00007299997,0.00006110038,0.0002766328],"genre_scores_gemma":[0.9620743,0.0003880828,0.03715031,0.00002701352,0.00009890905,0.000005316756,0.000147401,0.00002971499,0.000078895],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9705964,"threshold_uncertainty_score":0.671423,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02261428677898578,"score_gpt":0.2456040060273018,"score_spread":0.222989719248316,"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."}}