{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001803511,0.0016866,0.002340444,0.001047863,0.0008401321,0.002114812,0.002570903,0.00279792,0.008191031],"category_scores_gemma":[0.004000808,0.00091004,0.001227899,0.002313339,0.0006119568,0.002317041,0.001674284,0.00264816,0.001371075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001683626,"about_ca_system_score_gemma":0.002884738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005094344,"about_ca_topic_score_gemma":0.004925487,"domain_scores_codex":[0.9989552,0.0003469031,0.00004434312,0.0002306205,0.0002193299,0.0002035914],"domain_scores_gemma":[0.998406,0.001054597,0.0001052411,0.0001188206,0.0001923241,0.0001230331],"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.0002461192,0.0002542665,0.0005629733,0.0003202802,0.00006310352,0.0001339563,0.00009924398,0.8084608,0.001344703,0.03024298,0.006975188,0.1512964],"study_design_scores_gemma":[0.00004357776,0.0000401887,0.00006390195,0.00001379975,0.00001234146,0.00002525585,0.00001688391,0.9868198,0.0002590939,0.01140291,0.001296522,0.00000574376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01459923,0.0006426356,0.9787636,0.0003870719,0.00009081723,0.0002226809,0.0002556859,0.000517199,0.004521125],"genre_scores_gemma":[0.139052,0.0005251123,0.8543912,0.0001930147,0.00009420771,0.0004720171,0.0009657879,0.0002614289,0.004045271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008191031,"threshold_uncertainty_score":0.02740169,"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."}}