{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001040172,0.0000902918,0.00009838535,0.0001464632,0.0001990807,0.00004620663,0.00007696418,0.00003320471,0.000002754602],"category_scores_gemma":[0.00006823888,0.00009475389,0.0000168845,0.0005330752,0.0001642294,0.0003987287,0.000003473755,0.00006081589,0.000002961791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002538133,"about_ca_system_score_gemma":0.00002897456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001400906,"about_ca_topic_score_gemma":0.00009491709,"domain_scores_codex":[0.9990775,0.000007732501,0.0002088473,0.0002778615,0.000203148,0.0002249032],"domain_scores_gemma":[0.9996796,0.00003253106,0.0000376613,0.00009805255,0.0000825895,0.00006961957],"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.000005725261,0.00001218838,0.01727065,0.0002595159,0.00001513331,9.858452e-7,0.01044943,0.7705678,0.01633618,0.0009793601,0.0001258821,0.1839771],"study_design_scores_gemma":[0.0001916565,0.00001532721,0.06038183,0.00003905605,0.00001017272,0.000001482153,0.0001284869,0.9370301,0.001212814,0.0007750473,0.0000883387,0.0001256776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2447316,0.00005936493,0.7541012,0.0001151081,0.0002157431,0.0003542397,0.00000657036,0.0003845919,0.00003158704],"genre_scores_gemma":[0.7769727,0.00007702914,0.2226405,0.00001822049,0.00005922757,0.000103459,0.00001825258,0.00002457642,0.00008609193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.532241,"threshold_uncertainty_score":0.3863952,"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."}}