{"id":"https://openalex.org/W3179983824","doi":"https://doi.org/10.1145/3449726.3463187","title":"Using deep Q-network for selection hyper-heuristics","display_name":"Using deep Q-network for selection hyper-heuristics","publication_year":2021,"publication_date":"2021-07-07","ids":{"openalex":"https://openalex.org/W3179983824","doi":"https://doi.org/10.1145/3449726.3463187","mag":"3179983824"},"language":"en","primary_location":{"id":"doi:10.1145/3449726.3463187","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3449726.3463187","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},"type":"article","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/A5001994813","display_name":"Augusto Dantas","orcid":null},"institutions":[{"id":"https://openalex.org/I52418104","display_name":"Universidade Federal do Paran\u00e1","ror":"https://ror.org/05syd6y78","country_code":"BR","type":"education","lineage":["https://openalex.org/I52418104"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Augusto Dantas","raw_affiliation_strings":["Federal University of Paran\u00e1, Paran\u00e1, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Paran\u00e1, Paran\u00e1, Brazil","institution_ids":["https://openalex.org/I52418104"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084190061","display_name":"Alexander Fiabane do Rego","orcid":null},"institutions":[{"id":"https://openalex.org/I52418104","display_name":"Universidade Federal do Paran\u00e1","ror":"https://ror.org/05syd6y78","country_code":"BR","type":"education","lineage":["https://openalex.org/I52418104"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Alexander Fiabane do Rego","raw_affiliation_strings":["Federal University of Paran\u00e1, Paran\u00e1, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Paran\u00e1, Paran\u00e1, Brazil","institution_ids":["https://openalex.org/I52418104"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007123533","display_name":"Aurora Pozo","orcid":"https://orcid.org/0000-0001-5808-3919"},"institutions":[{"id":"https://openalex.org/I52418104","display_name":"Universidade Federal do Paran\u00e1","ror":"https://ror.org/05syd6y78","country_code":"BR","type":"education","lineage":["https://openalex.org/I52418104"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Aurora Pozo","raw_affiliation_strings":["Federal University of Paran\u00e1, Paran\u00e1, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Paran\u00e1, Paran\u00e1, Brazil","institution_ids":["https://openalex.org/I52418104"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I52418104"],"apc_list":null,"apc_paid":null,"fwci":1.0146,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.79685767,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1488","last_page":"1492"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983000159263611,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8176047801971436},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7196076512336731},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6939544081687927},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6667013168334961},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5954443216323853},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.48593512177467346},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4682368338108063},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4659138023853302},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4392312169075012},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.4383738040924072},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.43089744448661804},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.41579368710517883},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41264548897743225},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3788885474205017},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17230209708213806},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16530448198318481}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8176047801971436},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7196076512336731},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6939544081687927},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6667013168334961},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5954443216323853},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.48593512177467346},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4682368338108063},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4659138023853302},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4392312169075012},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4383738040924072},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.43089744448661804},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.41579368710517883},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41264548897743225},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3788885474205017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17230209708213806},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16530448198318481},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C188888258","wikidata":"https://www.wikidata.org/wiki/Q7353390","display_name":"Robot learning","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3449726.3463187","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3449726.3463187","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W32403112","https://openalex.org/W1814515812","https://openalex.org/W1829921621","https://openalex.org/W1978087130","https://openalex.org/W2082488647","https://openalex.org/W2083457599","https://openalex.org/W2151554678","https://openalex.org/W2159427933","https://openalex.org/W2168405694","https://openalex.org/W2209913494","https://openalex.org/W2580414719","https://openalex.org/W2731088668","https://openalex.org/W2904578876","https://openalex.org/W2967783393"],"related_works":["https://openalex.org/W2031913815","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W4297427155","https://openalex.org/W2975368677","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W3025823153","https://openalex.org/W4396214731"],"abstract_inverted_index":{"Hyper-Heuristics":[0],"is":[1,87,93],"an":[2],"active":[3],"research":[4],"field":[5],"that":[6,62,84,92],"aims":[7],"to":[8,96],"automatically":[9],"select":[10],"(or":[11],"generate)":[12],"the":[13,21,44,48,58,63,67,70,78,85,97,100],"best":[14],"low-level":[15],"heuristic":[16],"in":[17],"each":[18],"step":[19],"of":[20],"search":[22],"process.":[23],"This":[24,82],"work":[25],"investigates":[26],"a":[27,30,88],"Hyper-Heuristic":[28],"with":[29,39],"Deep":[31],"Q-Network":[32],"(DQN)":[33],"selection":[34,90],"strategy":[35,91],"and":[36,47,74],"compares":[37],"it":[38],"two":[40,55],"state-of-the-art":[41],"approaches,":[42],"namely":[43],"Dynamic":[45],"MAB":[46,101],"Fitness-Rate-Rank":[49],"MAB.":[50],"The":[51],"experiments":[52],"conducted":[53],"on":[54,69,77],"domains":[56],"from":[57],"HyFlex":[59],"framework":[60],"showed":[61],"DQN":[64,86],"approach":[65],"outperformed":[66],"others":[68],"Vehicle":[71],"Routing":[72],"Problem":[73],"was":[75],"competitive":[76],"Traveling":[79],"Salesman":[80],"Problem.":[81],"indicates":[83],"robust":[89],"less":[94],"sensitive":[95],"domain":[98],"than":[99],"based":[102],"approaches.":[103]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}