{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008534126,0.0002241565,0.0003117761,0.0001017779,0.0002923656,0.0001460191,0.00005308609,0.00007430237,0.00008966617],"category_scores_gemma":[0.00002149957,0.0001620816,0.00004186091,0.0002570403,0.0002627331,0.0001277043,0.000001373204,0.0003588326,0.000004583374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001156778,"about_ca_system_score_gemma":0.00006133883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003658159,"about_ca_topic_score_gemma":0.0001849938,"domain_scores_codex":[0.9985263,0.00006801311,0.0004157027,0.0003480435,0.0003494589,0.0002924849],"domain_scores_gemma":[0.9985858,0.0008634273,0.00005091202,0.00009368153,0.0002505821,0.0001556504],"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.0002938755,0.0001433478,0.005241518,0.05053706,0.001007069,0.0001394767,0.005257489,0.6385241,0.0003878594,0.04942685,0.002863193,0.2461782],"study_design_scores_gemma":[0.003033236,0.0005764111,0.01444809,0.006596402,0.0006752691,0.0000129106,0.0000650119,0.8247675,0.0001163401,0.0005711797,0.1483925,0.000745123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01018344,0.2042094,0.7709552,0.004383827,0.0002656815,0.007462323,0.00140925,0.0007566205,0.0003742578],"genre_scores_gemma":[0.9394097,0.05270833,0.00478689,0.0003363691,0.00009327915,0.0005927188,0.001601885,0.0001017541,0.0003691111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9292262,"threshold_uncertainty_score":0.6609495,"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."}}