{"id":"W4389219889","doi":"10.1016/j.ejor.2023.11.047","title":"A multiphase dynamic programming algorithm for the shortest path problem with resource constraints","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Column generation; Linear subspace; Scheduling (production processes); Shortest path problem; Crew scheduling; Dynamic programming; Disjoint sets; Algorithm; Mathematics; Theoretical computer science; Graph","routes":{"ca_aff":true,"ca_fund":true,"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.0009297454,0.0009861713,0.001262407,0.001044751,0.0007065097,0.00122676,0.001603828,0.001596073,0.006621716],"category_scores_gemma":[0.002070358,0.0009949333,0.0008598173,0.001276168,0.0005203065,0.001590438,0.001745608,0.001683309,0.0008732274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000871207,"about_ca_system_score_gemma":0.001850714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003338587,"about_ca_topic_score_gemma":0.003957822,"domain_scores_codex":[0.999548,0.0001237571,0.00002042369,0.0001093325,0.0001336365,0.00006483151],"domain_scores_gemma":[0.9993845,0.0004045925,0.00004505506,0.0000327746,0.00009212513,0.00004098033],"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.0001273876,0.0001776278,0.000234367,0.0001287287,0.00003983868,0.00005557961,0.00006622057,0.8145652,0.002645557,0.0279777,0.003203415,0.1507784],"study_design_scores_gemma":[0.00003512228,0.0000363289,0.00003186829,0.000008046261,0.000005864709,0.00001692336,0.000007626028,0.9934884,0.0003112155,0.004856873,0.001195766,0.00000597961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003989297,0.000100379,0.9930821,0.0001360529,0.00004727684,0.00006899718,0.00004609029,0.0002045292,0.002325253],"genre_scores_gemma":[0.0957781,0.0001679222,0.8992792,0.0001102879,0.00003958346,0.0003647164,0.0001681953,0.0001375341,0.003954418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006621716,"threshold_uncertainty_score":0.02215183,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06122002784236803,"score_gpt":0.3602148483024932,"score_spread":0.2989948204601252,"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."}}