{"id":"W4220659795","doi":"10.1287/trsc.2022.1135","title":"A Branch-and-Price-and-Cut Algorithm for the Vehicle Routing Problem with Two-Dimensional Loading Constraints","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Transport Canada","funders":"","keywords":"Vehicle routing problem; Branch and cut; Benchmark (surveying); Mathematical optimization; Relaxation (psychology); Constraint (computer-aided design); Algorithm; Routing (electronic design automation); Mathematics; Computer science; Integer programming","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"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.0004856431,0.00007418099,0.00006850871,0.00005624763,0.0006143734,0.00005831592,0.00009396613,0.000009227875,0.00004641029],"category_scores_gemma":[0.00000402748,0.00005813987,0.00001300707,0.0003785566,0.0002253211,0.0001842107,0.000005190168,0.00009318261,6.037628e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002182899,"about_ca_system_score_gemma":0.00004924793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000123752,"about_ca_topic_score_gemma":0.00001346248,"domain_scores_codex":[0.9992592,0.000007392892,0.0001361157,0.0001725969,0.0002497075,0.0001750103],"domain_scores_gemma":[0.9997015,0.00009686301,0.00003491729,0.000063402,0.00005238401,0.0000509518],"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.000006819909,0.000007445117,0.001541909,0.00001982244,0.00001139173,0.000001109042,0.003236004,0.9543238,0.003591883,0.003011404,0.00001240461,0.03423602],"study_design_scores_gemma":[0.0007113235,0.0000398405,0.005313386,0.000017874,0.00001659343,0.00001429273,0.0003027909,0.992002,0.001009131,0.0001890437,0.0002492236,0.0001344798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3306176,0.0001839436,0.6666357,0.0004694596,0.0002171857,0.0008234405,0.00007898203,0.0002570018,0.0007167204],"genre_scores_gemma":[0.979418,0.000004638279,0.02034071,0.0001095936,0.000009650765,0.00006187135,0.000008547838,0.00001055663,0.00003645791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6488004,"threshold_uncertainty_score":0.4725325,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01294203882816767,"score_gpt":0.2336807899293657,"score_spread":0.220738751101198,"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."}}