{"id":"W4414107824","doi":"10.1016/j.cor.2025.107279","title":"Q-learning-based hyper-heuristic algorithm for open dimension irregular packing problems","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"Hebei Provincial Department of Bureau of Science and Technology; National Natural Science Foundation of China","keywords":"Heuristic; Dimension (graph theory); Packing problems; Selection (genetic algorithm); Adaptability; Population; Computational complexity theory; Encoding (memory)","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.002211683,0.0008119498,0.002196027,0.00148354,0.000866392,0.001204757,0.002578978,0.002123424,0.005789552],"category_scores_gemma":[0.00574157,0.0007548612,0.000933654,0.001787605,0.001241985,0.001359132,0.001760078,0.001855557,0.0007459177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001345604,"about_ca_system_score_gemma":0.002943648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01053793,"about_ca_topic_score_gemma":0.007200292,"domain_scores_codex":[0.9991499,0.000352437,0.00004704608,0.0001225809,0.0001897383,0.0001382876],"domain_scores_gemma":[0.996538,0.002259632,0.0001945957,0.0001840565,0.0006448586,0.000178856],"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.0001749205,0.0001565308,0.0006157731,0.0001151777,0.00005110084,0.00005037917,0.00005142512,0.8936701,0.0006183916,0.009656115,0.002887429,0.09195272],"study_design_scores_gemma":[0.00001899144,0.00002227263,0.00003950752,0.000005427548,0.000004086611,0.000005794657,0.000004849196,0.997136,0.00007860006,0.002508252,0.0001735012,0.000002815284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02047027,0.0006431972,0.9741083,0.0003426873,0.0001378014,0.0001216014,0.00007715065,0.0004837281,0.003615301],"genre_scores_gemma":[0.4350501,0.0004523771,0.557411,0.0006143674,0.0001654693,0.000483865,0.0003915621,0.000207667,0.005223587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01053793,"threshold_uncertainty_score":0.02095318,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04778425585311696,"score_gpt":0.3481779421718182,"score_spread":0.3003936863187013,"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."}}