{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002760532,0.0002816191,0.0003433033,0.0001155069,0.0001391705,0.00007436496,0.0002956022,0.0001476126,0.001573888],"category_scores_gemma":[0.00002145081,0.000282156,0.0002035905,0.0003939497,0.00003177133,0.0004756793,0.000005265253,0.0001784818,0.00003072727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004084258,"about_ca_system_score_gemma":0.00008813437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000132059,"about_ca_topic_score_gemma":0.00001085461,"domain_scores_codex":[0.9982229,0.00001727374,0.0004426037,0.000410437,0.0003202577,0.0005864511],"domain_scores_gemma":[0.9992056,0.00004908179,0.00004756984,0.0002045487,0.000068084,0.000425037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004756612,0.0006200427,0.000762612,0.0007951474,0.0005446142,0.0001720002,0.006051587,0.04238345,0.005301308,0.009666197,0.05894256,0.8747129],"study_design_scores_gemma":[0.001076912,0.0001756893,0.003279319,0.00003701938,0.00003502181,0.00002171463,0.0002178715,0.3792441,0.0001544446,0.0001674683,0.6149783,0.0006121744],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03056181,0.0004207374,0.9509288,0.0008820952,0.0009000779,0.000654608,0.007589762,0.001631281,0.006430821],"genre_scores_gemma":[0.9601908,0.00002248157,0.03363545,0.0002770368,0.001077961,0.0003547559,0.004077246,0.0001359292,0.0002283756],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.929629,"threshold_uncertainty_score":0.999963,"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."}}