{"id":"W4205537357","doi":"10.1016/j.ejor.2021.12.050","title":"A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Transport Canada","funders":"Shanghai Jiao Tong University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Compute Canada; Polytechnique Montréal","keywords":"Vehicle routing problem; Branch and cut; Computer science; Mathematical optimization; Routing (electronic design automation); Integer programming; Branch and bound; Algorithm; Mathematics; Computer network","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"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.001122828,0.001537039,0.002137789,0.001375541,0.001083365,0.001595206,0.001892306,0.002805701,0.01078669],"category_scores_gemma":[0.002953763,0.00115084,0.001081674,0.002357832,0.0007145638,0.001721191,0.001673587,0.002683594,0.001626902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001146561,"about_ca_system_score_gemma":0.002913926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009892887,"about_ca_topic_score_gemma":0.009137001,"domain_scores_codex":[0.9994351,0.0001638807,0.00002577284,0.0000948445,0.000190369,0.00008999784],"domain_scores_gemma":[0.9986602,0.0009208014,0.00006261571,0.00005788091,0.0002089674,0.00008959942],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002060543,0.0002659628,0.0003797404,0.0001747898,0.00006628746,0.00009264956,0.00008473703,0.7084747,0.002510033,0.01330131,0.007871174,0.2665726],"study_design_scores_gemma":[0.00005636084,0.00004504531,0.00006854462,0.00001249586,0.00001197533,0.00002109873,0.00001492322,0.9925175,0.0003164989,0.005894491,0.001033686,0.000007405339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006356324,0.0002500553,0.989267,0.0002309282,0.00007912466,0.0001157897,0.0001173861,0.0005383618,0.003045107],"genre_scores_gemma":[0.05104277,0.0002716659,0.9443787,0.0001131796,0.00006280714,0.0003244526,0.0003807985,0.0002178099,0.003207771],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01078669,"threshold_uncertainty_score":0.03608507,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05341610305665129,"score_gpt":0.3333075957489059,"score_spread":0.2798914926922546,"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."}}