{"id":"W2172237755","doi":"10.1287/trsc.34.3.312.12298","title":"The Shortest Path Problem with Time Windows and Linear Waiting Costs","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":54,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Shortest path problem; Constrained Shortest Path First; K shortest path routing; Mathematical optimization; Path (computing); Longest path problem; Node (physics); Yen's algorithm; Computer science; Shortest Path Faster Algorithm; Integer programming; Fast path; Euclidean shortest path; Linear programming; Mathematics; Dijkstra's algorithm; Graph; Engineering; Theoretical computer science; 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.0009786059,0.001187866,0.001007016,0.0004302352,0.0006574584,0.00145267,0.001518466,0.001427774,0.006719112],"category_scores_gemma":[0.003872576,0.0004717404,0.0007356934,0.001433081,0.0008449471,0.004252719,0.001054505,0.001707894,0.0004769365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001295226,"about_ca_system_score_gemma":0.002457832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005530259,"about_ca_topic_score_gemma":0.003285546,"domain_scores_codex":[0.9989222,0.0004075283,0.00005259373,0.0002226582,0.000180894,0.0002141407],"domain_scores_gemma":[0.998404,0.001079695,0.0001811148,0.00008918756,0.0001209212,0.0001250997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002019605,0.0001282923,0.0003859032,0.0003884565,0.00007522462,0.000308666,0.0001424029,0.7294325,0.002373478,0.2117556,0.004436563,0.05037099],"study_design_scores_gemma":[0.0000927518,0.0001607188,0.0003118093,0.00003473982,0.00005343616,0.0002547136,0.0001416541,0.8367195,0.001348792,0.1477466,0.01309314,0.00004217718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08209178,0.001651912,0.8995214,0.001284637,0.0002220437,0.0002068661,0.0006758296,0.0003114197,0.01403404],"genre_scores_gemma":[0.6841705,0.002669708,0.2932985,0.0001902698,0.0003089227,0.0003962883,0.0009671029,0.0002302309,0.0177685],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006719112,"threshold_uncertainty_score":0.02247769,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01019813063589882,"score_gpt":0.2597355747385383,"score_spread":0.2495374441026395,"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."}}