{"id":"W4205930499","doi":"10.1287/ijoc.2021.1110","title":"Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Transport Canada","funders":"","keywords":"Vehicle routing problem; Computer science; Column generation; Algorithm; Mathematical optimization; Branch and cut; Routing (electronic design automation); Integer programming; Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003005686,0.002107691,0.002903878,0.001171017,0.0007470039,0.002078647,0.002869548,0.002608413,0.005779065],"category_scores_gemma":[0.008484128,0.001010863,0.00144481,0.002475148,0.0009977387,0.003679047,0.001584828,0.003858014,0.0008627829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002336576,"about_ca_system_score_gemma":0.003890191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006683962,"about_ca_topic_score_gemma":0.006973748,"domain_scores_codex":[0.9986588,0.0005086055,0.00009390041,0.0002330465,0.0002505795,0.0002550563],"domain_scores_gemma":[0.9927925,0.00564344,0.0004618062,0.0003444277,0.0005145504,0.000243241],"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.0001861283,0.0003170409,0.0007325761,0.0001464496,0.00006223539,0.00004930884,0.00005678834,0.8714579,0.0004587219,0.01383446,0.00265388,0.1100444],"study_design_scores_gemma":[0.00002039462,0.00002969548,0.00003771239,0.000004429045,0.000005447147,0.0000068807,0.000006046476,0.9952309,0.00009634568,0.004421379,0.0001378987,0.000002882337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03610787,0.0009554875,0.9568771,0.0007101268,0.0001157262,0.0002315535,0.0001320722,0.0007306573,0.004139513],"genre_scores_gemma":[0.2790102,0.0006381664,0.7146897,0.000357105,0.0001776334,0.0005290176,0.0005684919,0.0002604327,0.003769141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006683962,"threshold_uncertainty_score":0.01933289,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01316902341424659,"score_gpt":0.253346230159968,"score_spread":0.2401772067457214,"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."}}