{"id":"W4401515398","doi":"10.1287/trsc.2023.0252","title":"A Unified Branch-Price-and-Cut Algorithm for Multicompartment Pickup and Delivery Problems","year":2024,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Compartment (ship); Benchmark (surveying); Computer science; Flexibility (engineering); Branch and cut; Pickup; Mathematical optimization; Running time; Algorithm; Operations research; Mathematics; Integer programming; Artificial intelligence; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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.000445339,0.00008851467,0.00009111927,0.0001235493,0.0001004099,0.0001068059,0.00006902131,0.00002676451,0.000006978582],"category_scores_gemma":[0.000008871854,0.00008591069,0.00001756391,0.0003917794,0.0001095275,0.0003278358,0.000002373136,0.00005485807,0.00000220874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002931404,"about_ca_system_score_gemma":0.00003687424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008704054,"about_ca_topic_score_gemma":0.00001075789,"domain_scores_codex":[0.9992442,0.000007455666,0.0001809738,0.0002340355,0.0001615544,0.0001717956],"domain_scores_gemma":[0.999684,0.00009028125,0.00001402125,0.00007366413,0.00005886632,0.00007912541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000652226,0.00002584495,0.0009017769,0.0006812572,0.00003862545,0.000004683742,0.009960654,0.4015628,0.04149431,0.004845442,0.00006012954,0.540418],"study_design_scores_gemma":[0.0002307086,0.00001792845,0.008484312,0.00004563092,0.00001715496,0.000001859709,0.00004863386,0.9858733,0.003959372,0.0003152149,0.0008904115,0.0001154875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2017553,0.0003860477,0.7970058,0.00005443264,0.0001784008,0.0002696694,0.00002166296,0.0002543319,0.00007438329],"genre_scores_gemma":[0.7371734,0.00009228354,0.2625998,0.00002015189,0.00001562807,0.00003674361,0.000009325773,0.0000125489,0.00004014076],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5843105,"threshold_uncertainty_score":0.3503337,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02658557082439019,"score_gpt":0.2830538029403578,"score_spread":0.2564682321159676,"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."}}