{"id":"https://openalex.org/W4294811678","doi":"https://doi.org/10.1109/cec55065.2022.9870302","title":"Hybridizing A Genetic Algorithm With Reinforcement Learning for Automated Design of Genetic Algorithms","display_name":"Hybridizing A Genetic Algorithm With Reinforcement Learning for Automated Design of Genetic Algorithms","publication_year":2022,"publication_date":"2022-07-18","ids":{"openalex":"https://openalex.org/W4294811678","doi":"https://doi.org/10.1109/cec55065.2022.9870302"},"language":"en","primary_location":{"id":"doi:10.1109/cec55065.2022.9870302","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec55065.2022.9870302","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024558233","display_name":"Ahmed Nazar Hassan","orcid":"https://orcid.org/0000-0003-4475-5993"},"institutions":[{"id":"https://openalex.org/I69552723","display_name":"University of Pretoria","ror":"https://ror.org/00g0p6g84","country_code":"ZA","type":"education","lineage":["https://openalex.org/I69552723"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Ahmed Hassan","raw_affiliation_strings":["University of Pretoria,Department of Computer Science,Pretoria,South Africa","Department of Computer Science, University of Pretoria, Pretoria, South Africa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pretoria,Department of Computer Science,Pretoria,South Africa","institution_ids":["https://openalex.org/I69552723"]},{"raw_affiliation_string":"Department of Computer Science, University of Pretoria, Pretoria, South Africa","institution_ids":["https://openalex.org/I69552723"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060039893","display_name":"Nelishia Pillay","orcid":"https://orcid.org/0000-0003-3902-5582"},"institutions":[{"id":"https://openalex.org/I69552723","display_name":"University of Pretoria","ror":"https://ror.org/00g0p6g84","country_code":"ZA","type":"education","lineage":["https://openalex.org/I69552723"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Nelishia Pillay","raw_affiliation_strings":["University of Pretoria,Department of Computer Science,Pretoria,South Africa","Department of Computer Science, University of Pretoria, Pretoria, South Africa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pretoria,Department of Computer Science,Pretoria,South Africa","institution_ids":["https://openalex.org/I69552723"]},{"raw_affiliation_string":"Department of Computer Science, University of Pretoria, Pretoria, South Africa","institution_ids":["https://openalex.org/I69552723"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I69552723"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11159","display_name":"Manufacturing Process and Optimization","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.8150771856307983},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.695063591003418},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6641368865966797},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5926774144172668},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.548115611076355},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5323249101638794},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.47997379302978516},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4778729975223541},{"id":"https://openalex.org/keywords/meta-learning","display_name":"Meta learning (computer science)","score":0.4533317983150482},{"id":"https://openalex.org/keywords/population-based-incremental-learning","display_name":"Population-based incremental learning","score":0.4522750973701477},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.43922534584999084},{"id":"https://openalex.org/keywords/quality-control-and-genetic-algorithms","display_name":"Quality control and genetic algorithms","score":0.4373601973056793},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.3683091998100281},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11170157790184021},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.08685538172721863}],"concepts":[{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.8150771856307983},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.695063591003418},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6641368865966797},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5926774144172668},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.548115611076355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5323249101638794},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.47997379302978516},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4778729975223541},{"id":"https://openalex.org/C2781002164","wikidata":"https://www.wikidata.org/wiki/Q6822311","display_name":"Meta learning (computer science)","level":3,"score":0.4533317983150482},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.4522750973701477},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.43922534584999084},{"id":"https://openalex.org/C161164918","wikidata":"https://www.wikidata.org/wiki/Q7268775","display_name":"Quality control and genetic algorithms","level":4,"score":0.4373601973056793},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.3683091998100281},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11170157790184021},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.08685538172721863},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec55065.2022.9870302","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec55065.2022.9870302","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W41554520","https://openalex.org/W160204346","https://openalex.org/W1036195498","https://openalex.org/W1541691514","https://openalex.org/W1593880175","https://openalex.org/W1898867814","https://openalex.org/W1981970233","https://openalex.org/W1988526212","https://openalex.org/W2000982395","https://openalex.org/W2012451526","https://openalex.org/W2013695155","https://openalex.org/W2022830929","https://openalex.org/W2029484438","https://openalex.org/W2032392871","https://openalex.org/W2035260387","https://openalex.org/W2049791651","https://openalex.org/W2053093276","https://openalex.org/W2060747552","https://openalex.org/W2074821977","https://openalex.org/W2087784837","https://openalex.org/W2092582887","https://openalex.org/W2096166399","https://openalex.org/W2102043807","https://openalex.org/W2120297007","https://openalex.org/W2121044470","https://openalex.org/W2134954564","https://openalex.org/W2139771428","https://openalex.org/W2150834164","https://openalex.org/W2158804684","https://openalex.org/W2346138280","https://openalex.org/W2398671303","https://openalex.org/W2743199701","https://openalex.org/W2783585128","https://openalex.org/W2798000029","https://openalex.org/W2897105819","https://openalex.org/W2897221596","https://openalex.org/W2898119196","https://openalex.org/W2937748796","https://openalex.org/W2951665692","https://openalex.org/W3041202696","https://openalex.org/W3041310931","https://openalex.org/W3082377584","https://openalex.org/W3098258749","https://openalex.org/W3139377883","https://openalex.org/W3180616925","https://openalex.org/W4211023471","https://openalex.org/W4241727697","https://openalex.org/W6635771981","https://openalex.org/W6675437180","https://openalex.org/W6678230397","https://openalex.org/W6742420928"],"related_works":["https://openalex.org/W3130669838","https://openalex.org/W3200361725","https://openalex.org/W3169864268","https://openalex.org/W3011591403","https://openalex.org/W2002435483","https://openalex.org/W2983785000","https://openalex.org/W4287647350","https://openalex.org/W3022038857","https://openalex.org/W3143315506","https://openalex.org/W4294811678"],"abstract_inverted_index":{"The":[0,91,132],"automated":[1,40],"design":[2,22,41,82],"of":[3,33,65,93,103,109,164],"optimization":[4,12],"techniques":[5,13],"holds":[6],"great":[7],"promise":[8],"for":[9,37,85,144],"advancing":[10],"state-of-the-art":[11,155],"and":[14,106,135],"it":[15],"has":[16],"already":[17],"taken":[18],"over":[19],"the":[20,34,39,53,63,86,94,100,107,126,136,145,154,158,165,170],"manual":[21],"by":[23,169],"human":[24],"experts":[25],"in":[26],"some":[27,58],"problems.":[28],"Genetic":[29],"algorithms":[30,45,84,105],"are":[31,151],"one":[32],"key":[35],"approaches":[36],"tackling":[38],"problem.":[42,90],"Unfortunately,":[43],"these":[44],"may":[46],"take":[47],"several":[48],"hours":[49],"to":[50,61,80,98,113,116],"run":[51],"as":[52],"fitness":[54],"evaluation":[55],"involves":[56],"solving":[57],"benchmark":[59],"instances":[60],"determine":[62],"quality":[64],"a":[66,74,118],"candidate":[67,119],"configuration.":[68],"In":[69],"this":[70],"paper,":[71],"we":[72],"hybridize":[73],"meta-genetic":[75,95,137,171],"algorithm":[76,96,138,172],"with":[77,153],"reinforcement":[78,110,140,174],"learning":[79,111,141],"automatically":[81],"genetic":[83,104],"two-dimensional":[87,146],"bin":[88,147],"packing":[89,148],"task":[92,108],"is":[97,112],"search":[99],"configuration":[101,120],"space":[102],"decide":[114],"whether":[115],"evaluate":[117],"or":[121],"not.":[122],"Therefore,":[123],"avoiding":[124],"wasting":[125],"computational":[127,166],"budget":[128],"on":[129],"poor":[130],"configurations.":[131],"proposed":[133,159],"hybrid":[134,160],"without":[139,173],"produce":[142],"solvers":[143],"problem":[149],"that":[150],"competitive":[152],"algorithms.":[156],"However,":[157],"consumes":[161],"about":[162],"25%":[163],"effort":[167],"required":[168],"learning.":[175]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}