{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009270401,0.00008140291,0.00007316843,0.00004295278,0.001872868,0.0001625725,0.0001846231,0.00003246374,0.0001292378],"category_scores_gemma":[0.00001872873,0.00005778437,0.00001412668,0.000743499,0.000917353,0.0005973381,5.552263e-7,0.0000800946,0.00002378516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002771861,"about_ca_system_score_gemma":0.0002570496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004272024,"about_ca_topic_score_gemma":0.001652198,"domain_scores_codex":[0.9986526,0.00003357656,0.0001948892,0.0002518373,0.0005898997,0.0002771823],"domain_scores_gemma":[0.9994322,0.0001111128,0.0000673,0.00009281905,0.0001702056,0.0001263497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0003947827,0.0001757687,0.3207521,0.00002615678,0.00003606913,0.00004881515,0.1716158,0.137561,0.0016389,0.08650883,0.0003547478,0.280887],"study_design_scores_gemma":[0.001527347,0.0002754972,0.8844213,0.0002470575,0.00009131431,0.000005690922,0.01063607,0.04037424,0.0004686601,0.0005791956,0.0605223,0.0008513372],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9763756,0.00005097097,0.001366548,0.00125128,0.00003477006,0.0003874331,0.00001662852,0.0001607193,0.02035604],"genre_scores_gemma":[0.9951329,0.00011899,0.002962534,0.00008807443,0.00003098887,0.00001454865,0.00002430464,0.000006793123,0.001620905],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5636691,"threshold_uncertainty_score":0.9994265,"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."}}