{"id":"W2801088686","doi":"10.1287/trsc.2018.0820","title":"A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem","year":2018,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"TKI DINALOG","keywords":"Shortest path problem; K shortest path routing; Schedule; Mathematical optimization; Constrained Shortest Path First; Path (computing); Computer science; Yen's algorithm; Optimization problem; Sequence (biology); Function (biology); Traffic congestion; Dijkstra's algorithm; Algorithm; Mathematics; Engineering; Transport engineering; Computer network","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000937036,0.00147226,0.001189896,0.0008846013,0.001081901,0.0009811911,0.002083767,0.001953252,0.01393722],"category_scores_gemma":[0.004006427,0.0006302879,0.001194833,0.001934429,0.0007085776,0.002035247,0.002008324,0.002756265,0.002521866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001211639,"about_ca_system_score_gemma":0.003922893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006224259,"about_ca_topic_score_gemma":0.007260221,"domain_scores_codex":[0.9991546,0.0002359926,0.00004444131,0.0002075501,0.0002569039,0.0001005255],"domain_scores_gemma":[0.9993564,0.0003614374,0.00004552032,0.00006389887,0.0001259223,0.00004673474],"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.00008729333,0.0002097536,0.0005382869,0.0002731974,0.00007433577,0.0001874367,0.0001825288,0.6467848,0.002211162,0.1242803,0.01975753,0.2054134],"study_design_scores_gemma":[0.0001105858,0.00006981636,0.0001412414,0.00003351916,0.00002030496,0.0001300384,0.00005522961,0.903355,0.0006545972,0.07829887,0.01710683,0.00002386781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002036438,0.0001571776,0.9928584,0.0002463002,0.00005153416,0.0001477093,0.0001636598,0.0003031822,0.004035477],"genre_scores_gemma":[0.04032312,0.0003326351,0.9540697,0.00009660322,0.00004850969,0.0003817392,0.0005491636,0.0001836805,0.004014956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01393722,"threshold_uncertainty_score":0.0466246,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01652746680071451,"score_gpt":0.295051186129844,"score_spread":0.2785237193291296,"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."}}