{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009159861,0.0001091173,0.0001262341,0.0002351921,0.0003770803,0.0002513609,0.0003454805,0.00001887522,0.00002780576],"category_scores_gemma":[0.0005613823,0.00007173426,0.00005539327,0.0006521112,0.0001941252,0.0001458364,0.00004749343,0.0005259209,0.00002165343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007631991,"about_ca_system_score_gemma":0.0001497169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.970876e-7,"about_ca_topic_score_gemma":8.549822e-7,"domain_scores_codex":[0.9978116,0.0005684569,0.0004045693,0.0001301829,0.0007344742,0.0003507168],"domain_scores_gemma":[0.9977517,0.001114881,0.00005818799,0.0001441924,0.0008082106,0.0001228797],"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.00002645815,0.00002526,0.00006352948,0.00001571067,0.0000741407,0.0001278863,0.0004967756,0.5865046,0.0007045029,0.00008793553,0.001595577,0.4102776],"study_design_scores_gemma":[0.0009178501,0.0003017808,0.0008998305,0.0001154973,0.00001091457,0.0001760009,0.0006375915,0.9772605,0.00009644932,0.000009596512,0.01947235,0.0001016132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005877417,0.000137908,0.9911016,0.0008905168,0.00007251501,0.0006346723,0.00002569733,0.00009432383,0.001165355],"genre_scores_gemma":[0.2869832,0.00006023203,0.7119371,0.00003041746,0.0002961248,0.00003091312,0.0000277734,0.00009979184,0.000534415],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4101759,"threshold_uncertainty_score":0.3174644,"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."}}