{"id":"W4385877360","doi":"10.1287/trsc.2022.0261","title":"A Three-Front Parallel Branch-and-Cut Algorithm for Production and Inventory Routing Problems","year":2023,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; Transport Canada","funders":"","keywords":"Branch and cut; Benchmark (surveying); Mathematical optimization; Computer science; Branch and bound; Routing (electronic design automation); Production (economics); Heuristic; Time horizon; Algorithm; Vendor-managed inventory; Integer programming; Supply chain; Mathematics; Supply chain management","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.001258853,0.001764366,0.001590132,0.001458115,0.001138431,0.001578997,0.002204391,0.002202348,0.006175032],"category_scores_gemma":[0.002721694,0.0009476361,0.001380911,0.002239849,0.0005985549,0.001839035,0.001448724,0.002366966,0.001318321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001475583,"about_ca_system_score_gemma":0.002947658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009073329,"about_ca_topic_score_gemma":0.007739412,"domain_scores_codex":[0.9991658,0.0001841798,0.00003799971,0.0001664323,0.0003149787,0.0001306699],"domain_scores_gemma":[0.9991009,0.0004667532,0.00008373585,0.00008195977,0.0001913288,0.00007542241],"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.0001536761,0.000216724,0.0004124033,0.0001223273,0.00004765132,0.00008788783,0.00004966402,0.7725138,0.001714649,0.009344431,0.006164184,0.2091725],"study_design_scores_gemma":[0.0000479162,0.00003488183,0.00005496617,0.000006644387,0.000007684592,0.00002635993,0.000008810848,0.9937555,0.0004452757,0.004414555,0.001191262,0.000006130069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01085788,0.0003096323,0.9801244,0.0003116563,0.00006503543,0.0002266918,0.0001831466,0.0008659928,0.0070557],"genre_scores_gemma":[0.06853582,0.000212627,0.9266459,0.0001562821,0.00005165938,0.0003927382,0.0005268513,0.0001895168,0.003288484],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009073329,"threshold_uncertainty_score":0.0206576,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03466089813080044,"score_gpt":0.2828480735673259,"score_spread":0.2481871754365254,"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."}}