{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:32:58Z","timestamp":1730205178463,"version":"3.28.0"},"reference-count":46,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,7,18]]},"DOI":"10.1109\/cec55065.2022.9870302","type":"proceedings-article","created":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T15:28:14Z","timestamp":1662478094000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["Hybridizing A Genetic Algorithm With Reinforcement Learning for Automated Design of Genetic Algorithms"],"prefix":"10.1109","author":[{"given":"Ahmed","family":"Hassan","sequence":"first","affiliation":[{"name":"University of Pretoria,Department of Computer Science,Pretoria,South Africa"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nelishia","family":"Pillay","sequence":"additional","affiliation":[{"name":"University of Pretoria,Department of Computer Science,Pretoria,South Africa"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/ijoc.15.3.267.16080","article-title":"Guided local search for the three-dimensional bin-packing problem","volume":"15","author":"o","year":"2003","journal-title":"Informs Journal on Computing"},{"key":"ref38","first-page":"203","volume":"179","author":"f","year":"2010","journal-title":"A hybrid GRASP\/VND algorithm for two-and three-dimensional bin packing"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1287\/ijoc.11.4.345"},{"year":"2000","author":"e","journal-title":"Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods","key":"ref32"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","article-title":"Two-dimensional packing problems: A survey","volume":"141","author":"a","year":"2002","journal-title":"European Journal of Operational Research"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1016\/j.ins.2018.01.005"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/j.ijpe.2013.04.019","article-title":"A biased random key genetic algorithm for 2D and 3D bin packing problems","volume":"145","author":"j","year":"2013","journal-title":"International Journal of Production Economics"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","article-title":"Exact solution of the two-dimensional finite bin packing problem","volume":"44","author":"s","year":"1998","journal-title":"Management Science"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1057\/jors.1987.70","article-title":"Two-dimensional finite bin-packing algorithms","volume":"38","author":"j","year":"1987","journal-title":"Journal of the Operational Research Society"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0360-8352(96)00205-7","article-title":"Developing a simulated annealing algorithm for the cutting stock problem","volume":"32","author":"k","year":"1997","journal-title":"Computers & Industrial Engineering"},{"key":"ref10","first-page":"141","article-title":"A survey of parallel genetic algorithms","volume":"10","author":"cantu-paz","year":"1998","journal-title":"Calculateurs Paralleles Reseaux et Systems Repartis"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/S0377-2217(97)00388-3","article-title":"Approximation algorithms for the oriented two-dimensional bin packing problem","volume":"112","author":"a","year":"1999","journal-title":"European Journal of Operational Research"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/ICEEE.2011.6106655"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.3233\/IDA-2010-0424"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/3449726.3463203"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1016\/j.cie.2020.106778"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/SITIS.2010.22"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1016\/j.applthermaleng.2018.10.020"},{"key":"ref17","first-page":"692","article-title":"Controlling genetic algorithms with reinforcement learning","author":"pettinger","year":"0","journal-title":"Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1016\/j.cie.2018.10.045"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1108\/eb005486"},{"key":"ref28","volume":"37","author":"rummery","year":"1994","journal-title":"On-line Q-learning using connectionist systems"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1016\/j.eswa.2019.04.027"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1007\/BF00115009"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/MCI.2018.2806988","article-title":"Automated design of machine learning and search algorithms [guest editorial]","volume":"13","author":"n","year":"2018","journal-title":"IEEE Computational Intelligence Magazine"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TCYB.2016.2562674"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1016\/j.eswa.2020.113695"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.2514\/2.1999"},{"key":"ref8","volume":"1","author":"cantu-paz","year":"2000","journal-title":"Efficient and Accurate Parallel Genetic Algorithms"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1007\/s00500-003-0328-5"},{"year":"2011","author":"m","journal-title":"The irace package Iterated race for automatic algorithm configuration","key":"ref2"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/315891.316014"},{"year":"2009","author":"hutter","journal-title":"Automated configuration of algorithms for solving hard computational problems","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1007\/0-387-28356-0_4"},{"key":"ref20","first-page":"25","article-title":"Evolving the structure of the particle swarm optimization algorithms","author":"diosan","year":"0","journal-title":"European Conference on Evolutionary Computation in Combinatorial Optimization"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","article-title":"A practical tutorial on the use of nonpara-metric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms","volume":"1","author":"j","year":"2011","journal-title":"Swarm and Evolutionary Computation"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/SSCI.2016.7850138"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10710-009-9081-6","article-title":"Evolutionary design of evolutionary algorithms","volume":"10","author":"l","year":"2009","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"ref42","first-page":"135","article-title":"The two-dimensional finite bin packing problem. part II: New lower and upper bounds","volume":"1","author":"m","year":"2003","journal-title":"Quarterly Journal of the Belgian French and Italian Operations Research Societies"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/CEC.2018.8477881"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1287\/ijoc.1040.0089","article-title":"A set-covering-based heuristic approach for bin-packing problems","volume":"18","author":"m","year":"2006","journal-title":"Informs Journal on Computing"},{"key":"ref23","first-page":"369","article-title":"A meta-genetic algorithm for hybridizing metaheuristics","author":"hassan","year":"2017","journal-title":"Portuguese conference on Artificial Intelligence"},{"key":"ref44","first-page":"65","article-title":"A simple sequentially rejective multiple test procedure","author":"holm","year":"1979","journal-title":"Scandinavian Journal of Statistics"},{"year":"2018","author":"sutton","journal-title":"Reinforcement Learning An Introduction","key":"ref26"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","article-title":"The use of ranks to avoid the assumption of normality implicit in the analysis of variance","volume":"32","author":"m","year":"1937","journal-title":"Journal of the American Statistical Association"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1023\/A:1016540724870","article-title":"A taxonomy of hybrid metaheuristics","volume":"8","author":"e-g","year":"2002","journal-title":"Journal of Heuristics"}],"event":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2022,7,18]]},"location":"Padua, Italy","end":{"date-parts":[[2022,7,23]]}},"container-title":["2022 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9870216\/9870201\/09870302.pdf?arnumber=9870302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T17:15:24Z","timestamp":1664212524000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9870302\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,18]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/cec55065.2022.9870302","relation":{},"subject":[],"published":{"date-parts":[[2022,7,18]]}}}