{"id":"W2562410910","doi":"10.1155/2017/9216864","title":"Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks","year":2017,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Hong Kong; Jessie and George Ho Charitable Foundation","keywords":"Schedule; Computer science; Path (computing); Transport engineering; Operations research; Transit (satellite); Algorithm; Mathematical optimization; Public transport; Engineering; Computer network; Mathematics","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.003745084,0.001562381,0.001831375,0.002114563,0.0008937428,0.001477187,0.003925953,0.002044339,0.004651682],"category_scores_gemma":[0.007731509,0.0009695436,0.002446236,0.002917843,0.001233607,0.003375007,0.002489303,0.002292499,0.001029731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001991053,"about_ca_system_score_gemma":0.004540992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01580012,"about_ca_topic_score_gemma":0.01631494,"domain_scores_codex":[0.9978867,0.0008348781,0.0001840769,0.0003816068,0.0004967871,0.0002159789],"domain_scores_gemma":[0.9974539,0.001059343,0.0002034922,0.00042876,0.0006701072,0.0001844529],"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.0002048,0.0001252702,0.001118817,0.000147159,0.00009539066,0.0001166556,0.0001418051,0.8100165,0.001443546,0.04382369,0.005611023,0.1371553],"study_design_scores_gemma":[0.00003792337,0.00005274527,0.0001625478,0.00001259806,0.00002414521,0.00004551569,0.0000149199,0.9866895,0.0004529694,0.007918044,0.004562396,0.00002669461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006060893,0.0002500569,0.9900585,0.0001848473,0.00008619283,0.0001515469,0.00008609211,0.0002836937,0.002838265],"genre_scores_gemma":[0.05424289,0.0004500803,0.9390232,0.0001472564,0.00007210314,0.000344825,0.0002746258,0.0001261544,0.005318819],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01580012,"threshold_uncertainty_score":0.0314163,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02210901316931929,"score_gpt":0.3091386937718797,"score_spread":0.2870296806025604,"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."}}