{"id":"W4404875870","doi":"10.1016/j.tre.2024.103866","title":"Contextual bandits learning-based branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with conflicts and time windows","year":2024,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Computer science; Algorithm; Mathematical optimization; Artificial intelligence; Operations research; 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.002244067,0.001661049,0.004099314,0.001575329,0.0009768161,0.001809163,0.003494957,0.002991609,0.005983171],"category_scores_gemma":[0.005469239,0.001351908,0.001226623,0.002086636,0.001168605,0.002859246,0.001951609,0.003587799,0.0008447088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001790906,"about_ca_system_score_gemma":0.003650839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01249787,"about_ca_topic_score_gemma":0.01036475,"domain_scores_codex":[0.9989461,0.0003765572,0.00006195041,0.0001881424,0.0002205059,0.0002066653],"domain_scores_gemma":[0.9963341,0.00270966,0.0002051524,0.0001372796,0.000404549,0.0002093158],"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.000402004,0.0003159486,0.0008254449,0.0001532584,0.00008223115,0.00004549181,0.00006595931,0.8436004,0.0006796815,0.01108827,0.00421296,0.1385283],"study_design_scores_gemma":[0.00001542565,0.00002611709,0.00004654911,0.000006972954,0.000007815641,0.000005123086,0.000006025853,0.997216,0.00008143215,0.002435999,0.0001494951,0.000003120015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03660266,0.001920622,0.9561078,0.0005589103,0.0001537271,0.0001319077,0.0001316756,0.001085153,0.003307544],"genre_scores_gemma":[0.5020856,0.001187993,0.4894226,0.0005485132,0.0002436566,0.0005058433,0.0008163892,0.0003909394,0.004798374],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01249787,"threshold_uncertainty_score":0.02485025,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04682250394142141,"score_gpt":0.3142968919625639,"score_spread":0.2674743880211425,"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."}}