{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009068138,0.0001577381,0.0002020541,0.0004355099,0.000829926,0.0008538121,0.0005272776,0.00009827513,0.00004421558],"category_scores_gemma":[0.0001102351,0.0001624798,0.00005341839,0.00086457,0.00007384575,0.0002010671,0.0002075282,0.0003879527,0.00003736796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001413794,"about_ca_system_score_gemma":0.0001718757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004413761,"about_ca_topic_score_gemma":0.00003282848,"domain_scores_codex":[0.9985172,0.0001850852,0.0002859612,0.0003360841,0.0002545968,0.0004210615],"domain_scores_gemma":[0.9987296,0.0003157827,0.00001056793,0.0003385493,0.0005120755,0.00009337717],"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.000003554173,0.00004320801,0.00004277667,0.0000868775,0.00002783595,0.000001019057,0.0001775257,0.9428287,0.0003606991,0.0008468215,0.007411893,0.04816908],"study_design_scores_gemma":[0.0007570325,0.0001008986,0.00005119875,0.00022179,0.000007877827,0.00000105931,0.00003949933,0.9584861,0.0008295483,0.0001409598,0.03920164,0.0001623415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008140867,0.0002857033,0.9943475,0.0007032834,0.0005009329,0.001604537,0.00001112863,0.000273619,0.001459194],"genre_scores_gemma":[0.5745643,0.0001200844,0.4161685,0.0003431807,0.0001882408,0.0011442,0.0006371772,0.0001319612,0.00670233],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.578179,"threshold_uncertainty_score":0.823333,"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."}}