{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00147448,0.0002108737,0.0002491265,0.00008631832,0.0007371149,0.0003451328,0.0001033712,0.00006443475,0.00002038236],"category_scores_gemma":[0.0002567888,0.0001504556,0.00005769519,0.0002358944,0.00008751755,0.0001946043,0.00005427755,0.0006895005,0.000003865841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007194916,"about_ca_system_score_gemma":0.000102864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001296918,"about_ca_topic_score_gemma":3.946128e-7,"domain_scores_codex":[0.998658,0.00006568107,0.0004326673,0.0001757269,0.0002696811,0.0003982205],"domain_scores_gemma":[0.9978744,0.001466884,0.0001979825,0.0001006305,0.0002225937,0.0001375306],"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.00001924899,0.000006471595,0.001268762,0.00003010051,0.00006831469,0.00001231139,0.00033622,0.9019687,0.0007694502,0.00005136126,0.00001330249,0.0954558],"study_design_scores_gemma":[0.001880443,0.0001150974,0.0008937847,0.0003528175,0.00002809029,0.0006420354,0.0001106643,0.9936768,0.001831515,0.00004197777,0.0002084478,0.0002183422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3182594,0.0001882226,0.6800103,0.0003209906,0.0001642294,0.0002536995,0.000002527322,0.0001904994,0.0006100968],"genre_scores_gemma":[0.8475667,0.000004475878,0.1518445,0.0003008062,0.0001942323,0.000002669922,0.000003512945,0.00004303429,0.00004007075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5293072,"threshold_uncertainty_score":0.6135401,"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."}}