{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006068288,0.000490024,0.0007739578,0.0003920563,0.0003551314,0.0005250571,0.0007002708,0.0008886276,0.001462048],"category_scores_gemma":[0.001015074,0.0003571456,0.0007219356,0.0005217837,0.0004491716,0.0004540732,0.0003903208,0.0006242311,0.0001564629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007915383,"about_ca_system_score_gemma":0.001211565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009325458,"about_ca_topic_score_gemma":0.006951698,"domain_scores_codex":[0.9997602,0.0001126734,0.000009058505,0.00004390656,0.00004468808,0.00002950959],"domain_scores_gemma":[0.9996927,0.0001817201,0.0000423767,0.00002065937,0.00004665622,0.00001583174],"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.00001251952,0.00001344178,0.0001241778,0.000009825139,0.000009591491,0.00001088349,0.00001112815,0.9949527,0.0003221814,0.001151725,0.0001202677,0.003261669],"study_design_scores_gemma":[0.000003492093,0.000009498343,0.00002895852,0.000001114119,0.000002249742,0.000002031821,0.000002459224,0.9995185,0.00006509755,0.0002440543,0.000121571,9.083176e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05388005,0.0001480345,0.9401361,0.0001764072,0.00002667689,0.00007930703,0.00007150493,0.0002565121,0.005225399],"genre_scores_gemma":[0.7443478,0.0002131153,0.2502379,0.00009004872,0.00002618658,0.0003519849,0.0001830279,0.00007638342,0.004473545],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009325458,"threshold_uncertainty_score":0.01854235,"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."}}