{"id":"W3088031960","doi":"10.1007/s12469-020-00253-x","title":"Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path","year":2020,"lang":"en","type":"article","venue":"Public Transport","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Trafikverket; Horizon 2020 Framework Programme; Linköpings Universitet; H2020 Societal Challenges; Canadian Centre for Applied Research in Cancer Control","keywords":"Bottleneck; Train; Dijkstra's algorithm; Algorithm; Path (computing); Robustness (evolution); Computer science; Shortest path problem; Graph; Mathematical optimization; Engineering; Mathematics; Theoretical computer science; Geography","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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.0008614673,0.001195754,0.0009479965,0.001674753,0.0009941136,0.0008051294,0.002071282,0.001030293,0.01139745],"category_scores_gemma":[0.002699133,0.000543624,0.0009695113,0.001745316,0.0006058285,0.001821414,0.001353667,0.00086204,0.001455094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001275244,"about_ca_system_score_gemma":0.003057296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01230987,"about_ca_topic_score_gemma":0.01104281,"domain_scores_codex":[0.9994381,0.0001184962,0.00002984267,0.000171907,0.0001368524,0.0001047543],"domain_scores_gemma":[0.998858,0.0005873542,0.0001056939,0.000151411,0.0002001315,0.00009742353],"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.0006210516,0.0005098814,0.001429238,0.0004348036,0.00009466067,0.0001906273,0.0002777485,0.6391517,0.01566167,0.0228343,0.01586238,0.302932],"study_design_scores_gemma":[0.00008630555,0.00009712695,0.0002480273,0.0000139817,0.00002014373,0.00005293094,0.00004275814,0.9860016,0.003607399,0.006700536,0.003113945,0.00001512277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05186455,0.0002013328,0.9360488,0.0002098167,0.00005521054,0.0002698435,0.0008136701,0.00505412,0.005482696],"genre_scores_gemma":[0.1823385,0.00007834185,0.8113469,0.00006437131,0.00002179732,0.0002306083,0.001959322,0.0005327464,0.003427348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01230987,"threshold_uncertainty_score":0.03812826,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02808826776181262,"score_gpt":0.211321044878307,"score_spread":0.1832327771164944,"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."}}