{"id":"W4311813654","doi":"10.1155/2022/9604362","title":"Train Scheduling Optimization for an Urban Rail Transit Line: A Simulated-Annealing Algorithm Using a Large Neighborhood Search Metaheuristic","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Chengdu Science and Technology Program; Sichuan Province Science and Technology Support Program; National Key Research and Development Program of China; Jiangsu Development and Reform Commission; National Natural Science Foundation of China; China Railway","keywords":"Headway; Simulated annealing; Urban rail transit; Dwell time; Train; Schedule; Metaheuristic; Scheduling (production processes); Interval (graph theory); Urban transit; Simulation; Computer science; Heuristic; Mathematical optimization; Engineering; Algorithm; Mathematics; Transport engineering; Public transport","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.0006642042,0.0001817867,0.0003416903,0.0002744264,0.0002794667,0.00003416864,0.0001490191,0.000060624,0.00002798349],"category_scores_gemma":[0.00001467964,0.0001955071,0.0001868066,0.0004215205,0.000009942973,0.0005726456,0.000001506306,0.0003064316,1.018089e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001272405,"about_ca_system_score_gemma":0.00007491255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006785049,"about_ca_topic_score_gemma":0.000006794431,"domain_scores_codex":[0.9982553,0.0000595214,0.000798371,0.0001728994,0.0003995323,0.0003143565],"domain_scores_gemma":[0.9992799,0.00006066994,0.0002011044,0.0001079337,0.0002289292,0.0001214465],"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.00009202197,0.00007772585,0.00002138485,0.00009243268,0.00007380825,0.00001652699,0.003934987,0.9827557,0.008650895,0.0001020569,0.000001305076,0.004181195],"study_design_scores_gemma":[0.002025202,0.0004103905,0.00009750415,0.0000555613,0.0001297279,0.00002169527,0.00213022,0.9939693,0.000714753,0.00007022334,0.0001695449,0.0002058981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3194488,0.00057483,0.6792082,0.00001053456,0.0004373779,0.0001860855,0.00007798176,0.00005049268,0.000005648431],"genre_scores_gemma":[0.8744349,0.00003291066,0.1251055,0.0000125553,0.0002150376,0.000009188007,0.000122164,0.00006275447,0.000004954069],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5549861,"threshold_uncertainty_score":0.7972547,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01767333477595389,"score_gpt":0.2630737296550005,"score_spread":0.2454003948790466,"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."}}