{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001062096,0.00009122255,0.00008666854,0.00008565141,0.001633443,0.0001645049,0.0002207216,0.0000580091,0.0001178839],"category_scores_gemma":[0.00005983749,0.00007236336,0.00002820049,0.0008342237,0.001120276,0.0006306189,0.000001401398,0.00005253795,0.000006847458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002478287,"about_ca_system_score_gemma":0.0002651311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002317771,"about_ca_topic_score_gemma":0.0006948399,"domain_scores_codex":[0.9987364,0.00002424326,0.0002107464,0.0002990293,0.0004678958,0.0002616906],"domain_scores_gemma":[0.9989933,0.0001483402,0.0001016358,0.0001078804,0.0005398794,0.0001090005],"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.000194507,0.0002380454,0.01935932,0.00003633545,0.0000703081,0.000006545637,0.2230566,0.5251244,0.002201041,0.04559277,0.00313606,0.1809841],"study_design_scores_gemma":[0.0006832004,0.0001527522,0.04310632,0.00003887571,0.00009768064,0.000001183619,0.002493059,0.9372225,0.0003718056,0.0005874613,0.01491593,0.0003292554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01559617,0.00006644137,0.9790037,0.001765803,0.0002493742,0.0009952036,0.00009349042,0.0001907808,0.002039089],"genre_scores_gemma":[0.7344754,0.0001082286,0.2630174,0.000425947,0.0002920106,0.00004700789,0.0001635367,0.00001828919,0.001452165],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7188792,"threshold_uncertainty_score":0.9996663,"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."}}