{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T16:39:29Z","timestamp":1778863169199,"version":"3.51.4"},"reference-count":69,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda (CONACYT) Basic Science Project","doi-asserted-by":"publisher","award":["287479"],"award-info":[{"award-number":["287479"]}],"id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004961","name":"Research Group with Strategic Focus in Intelligent Systems at Instituto Tecnol\u00f3gico y de Estudios Superiores de Monterrey","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004961","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3106815","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T20:39:26Z","timestamp":1629751166000},"page":"116500-116527","source":"Crossref","is-referenced-by-count":10,"title":["Sequence-Based Selection Hyper-Heuristic Model via MAP-Elites"],"prefix":"10.1109","volume":"9","author":[{"given":"Melissa","family":"Sanchez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge M.","family":"Cruz-Duarte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose C.","family":"Ortiz-Bayliss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Amaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-3052-3"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi9070432"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389142"},{"key":"ref32","first-page":"1939","article-title":"Doubly balanced connected graph partitioning","author":"soltan","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2016.7795738"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1511\/2002.2.113"},{"key":"ref37","first-page":"1","article-title":"Fast and stable repartitioning of road networks","author":"buchhold","year":"2020","journal-title":"Proc 18th Int Symp Exp Algorithms"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2020.02.008"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104935"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1080\/24725854.2020.1732506"},{"key":"ref60","article-title":"Multi-objective analysis of MAP-elites performance","author":"samuelsen","year":"2018","journal-title":"arXiv 1803 05174"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185591"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04735-1_1"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-013-9186-9"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1038\/nature14422"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.3968"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.5772\/intechopen.69222"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/2908961.2931728"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99259-4_30"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3319619.3321939"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-03822-w"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8789928"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29124-1_12"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2019.106682"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2926455"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8790296"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100765"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106570"},{"key":"ref24","first-page":"488","volume":"11101","author":"urquhart","year":"2018","journal-title":"Optimisation and Illumination of a Real-World Workforce Scheduling and Routing Application (WSRP) Via Map-Elites"},{"key":"ref23","article-title":"Illuminating search spaces by mapping elites","author":"mouret","year":"2015","journal-title":"arxiv 1504 04909"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.12.012"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.12.050"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2019.11.168"},{"key":"ref51","doi-asserted-by":"crossref","first-page":"39","DOI":"10.4018\/jamc.2010102603","article-title":"A reinforcement learning–great-deluge hyper-heuristic for examination timetabling","volume":"1","author":"\u00f6zcan","year":"2010","journal-title":"Int J Appl Metaheuristic Comput"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00231"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-018-09404-7"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.10.022"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2019.0934"},{"key":"ref55","first-page":"503","article-title":"A Sequence-based selection hyper-heuristic: A case study in nurse rostering","author":"kheiri","year":"2016","journal-title":"Proc 5th Int Conf Practice Theory Automated Timetabling (PATAT)"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754766"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185671"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185709"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.02.041"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106040"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-019-1945-5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-017-9605-z"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3076426"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3390\/math8112046"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96514-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.07.073"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2018.2807018"},{"key":"ref18","first-page":"453","volume":"272","author":"burke","year":"2019","journal-title":"A Classification of Hyper-heuristic Approaches"},{"key":"ref19","first-page":"1","article-title":"Adaptively parameterised hyperheuristics for sales summit scheduling","author":"cowling","year":"2001","journal-title":"Proc Sel 4th Metaheuristics Int Conf"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2868942"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3009318"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.12.006"},{"key":"ref5","first-page":"136","article-title":"HyFlex: A benchmark framework for cross-domain heuristic search","author":"ochoa","year":"2012","journal-title":"Proc 12th Eur Conf Evol Comput Combinat Optim"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022602019183"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29828-8_16"},{"key":"ref49","first-page":"1","article-title":"A reinforcement learning hyper-heuristic for the optimisation of flight connections","author":"pylyavskyy","year":"2020","journal-title":"Proc IEEE Congr Evol Comput (CEC)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.23919\/DATE48585.2020.9116409"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2018.2889985"},{"key":"ref48","first-page":"3133","article-title":"Exploring reward-based hyper-heuristics for the job-shop scheduling problem","author":"lara-c\u00e1rdenas","year":"2020","journal-title":"Proc IEEE Symp Ser Comput Intell (SSCI)"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-44973-4_43"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2937634"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2893942"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2019.8864591"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1177\/1094342019846956"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09520416.pdf?arnumber=9520416","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:57:35Z","timestamp":1639771055000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9520416\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":69,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3106815","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}