{"id":"W2134381195","doi":"10.1287/trsc.2013.0489","title":"A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Column generation; Vehicle routing problem; Mathematical optimization; Integer programming; Routing (electronic design automation); Branch and price; Shortest path problem; Computer science; Linear programming relaxation; Set (abstract data type); Relaxation (psychology); Branch and cut; Extension (predicate logic); Linear programming; Path (computing); Integer (computer science); Mathematics; Graph; Theoretical computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.00112135,0.00011786,0.0001136352,0.0000645823,0.000300699,0.0001053993,0.0002185804,0.00002805743,0.000004228717],"category_scores_gemma":[0.00006129283,0.00008437414,0.0000235046,0.0005268446,0.0001828128,0.0003618419,0.000004340664,0.00009606584,0.000001771724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002371056,"about_ca_system_score_gemma":0.00002697923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002689138,"about_ca_topic_score_gemma":0.00004009479,"domain_scores_codex":[0.9989917,0.00001912147,0.0002319168,0.0002431812,0.0002517413,0.0002622988],"domain_scores_gemma":[0.9992138,0.0003533136,0.00005968815,0.0001618287,0.0001427227,0.00006869759],"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.00001051079,0.0000137301,0.009961514,0.00006839611,0.00001913989,4.553646e-7,0.004938202,0.6126649,0.01284087,0.001916522,0.000008522016,0.3575572],"study_design_scores_gemma":[0.0004040661,0.00003319033,0.05149225,0.00003237392,0.00001759841,0.000002236359,0.0001341826,0.9403871,0.007123526,0.00009106728,0.0001520956,0.000130304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1241871,0.00002894073,0.8748915,0.0001257261,0.00007159558,0.0002921944,0.000005372718,0.0002117293,0.000185919],"genre_scores_gemma":[0.6823589,0.000005652295,0.3174783,0.00005025115,0.00002412957,0.00004221189,0.000002318965,0.00001642548,0.00002181575],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5581719,"threshold_uncertainty_score":0.3440678,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01218817935459664,"score_gpt":0.2552692186820874,"score_spread":0.2430810393274907,"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."}}