{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T00:27:30Z","timestamp":1772497650076,"version":"3.50.1"},"reference-count":72,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"TAILOR, a project"},{"DOI":"10.13039\/100010669","name":"EU Horizon 2020 Research and Innovation Programme","doi-asserted-by":"publisher","award":["952215"],"award-info":[{"award-number":["952215"]}],"id":[{"id":"10.13039\/100010669","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202025"],"award-info":[{"award-number":["62202025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1109\/tevc.2022.3215013","type":"journal-article","created":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T21:07:45Z","timestamp":1667509665000},"page":"1351-1364","source":"Crossref","is-referenced-by-count":2,"title":["Sparkle: Toward Accessible Meta-Algorithmics for Improving the State of the Art in Solving Challenging Problems"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4653-0707","authenticated-orcid":false,"given":"Koen","family":"van der Blom","sequence":"first","affiliation":[{"name":"Faculty of Science, Leiden University, Leiden, The Netherlands"}]},{"given":"Holger H.","family":"Hoos","sequence":"additional","affiliation":[{"name":"Faculty of Science, Leiden University, Leiden, The Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5028-1064","authenticated-orcid":false,"given":"Chuan","family":"Luo","sequence":"additional","affiliation":[{"name":"Faculty of Science, Leiden University, Leiden, The Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3921-0107","authenticated-orcid":false,"given":"Jeroen G.","family":"Rook","sequence":"additional","affiliation":[{"name":"Faculty of Science, Leiden University, Leiden, The Netherlands"}]}],"member":"263","reference":[{"key":"ref72","first-page":"754","article-title":"An efficient approach for assessing hyperparameter importance","volume":"32","author":"hutter","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn (ICML)"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-44973-4_40"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50349-3_3"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24605-3_34"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/TEVC.2014.2302006","article-title":"Exploratory landscape analysis of continuous space optimization problems using information content","volume":"19","author":"mu\u00f1oz","year":"2015","journal-title":"IEEE Trans Evol Comput"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2641190.2641198"},{"key":"ref32","article-title":"AutoGluon-tabular: Robust and accurate AutoML for structured data","author":"erickson","year":"2020","journal-title":"arXiv 2003 06505"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05318-5_6"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.04.003"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v35i3.2460"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00242"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34413-8_15"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_47"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72013-1_16"},{"key":"ref62","article-title":"From classical to hierarchical: Benchmarks for the HTN track of the international planning competition","author":"pellier","year":"2021","journal-title":"arXiv 2103 05481"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888918000012"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-014-9275-9"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390211"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00081-3"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2861"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1126\/science.275.5296.51"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27436-2_21"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09584-4_4"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190018"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190083"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"ref2","first-page":"751","article-title":"ISAC—Instance-specific algorithm configuration","author":"kadioglu","year":"2010","journal-title":"Proc 19th Eur Conf Artif Intell (ECAI)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-004-0183-4"},{"key":"ref20","first-page":"507","article-title":"Sequential model-based optimization for general algorithm configuration","author":"hutter","year":"2011","journal-title":"Proc 5th Int Conf Learn Intell Optim (LION)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3449726.3463276"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1808977"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2019.106027","article-title":"Benchmarking discrete optimization heuristics with IOHprofiler","volume":"88","author":"doerr","year":"2020","journal-title":"Appl Soft Comput J"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2005.1554761"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3449726.3463155"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.05.004"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10440"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/180"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58112-1_26"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.3233\/AIC-170537"},{"key":"ref56","first-page":"733","article-title":"Model-based genetic algorithms for algorithm configuration","author":"ans\u00f3tegui","year":"2015","journal-title":"Proc Intern Joint Conf Artificial Intel (IJCAI)"},{"key":"ref55","author":"hutter","year":"2015","journal-title":"Manual for SMAC version v2 10 03-master"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1142\/S021821301460032X"},{"key":"ref53","article-title":"On algorithm selection, with an application to combinatorial search problems","author":"kotthoff","year":"2012"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_18"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2490"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/11527695_25"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10660"},{"key":"ref13","first-page":"16","article-title":"Hydra-MIP: Automated algorithm configuration and selection for mixed integer programming","author":"xu","year":"2011","journal-title":"Proc 18th RCRA Workshop Exp Eval Algorithms Solving Problems Comb Explosion (RCRA)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.08.018"},{"key":"ref15","first-page":"73","author":"bridge","year":"2012","journal-title":"Case-Based Reasoning for Autonomous Constraint Solving"},{"key":"ref16","first-page":"28","article-title":"Fast downward stone soup: A baseline for building planner portfolios","author":"helmert","year":"2011","journal-title":"Proc ICAPS Workshop Plan Learn"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11420"},{"key":"ref18","article-title":"Survey of machine-learning experimental methods at NeurIPS2019 and ICLR2020","author":"bouthillier","year":"2020"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4726"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.12.006"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.09.006"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13520-0_23"},{"key":"ref5","first-page":"608","article-title":"Algorithm portfolios based on cost-sensitive hierarchical clustering","author":"malitsky","year":"2013","journal-title":"Proc Intern Joint Conf Artificial Intel (IJCAI)"},{"key":"ref8","first-page":"1","article-title":"Auto-WEKA 2.0: Automatic model selection and hyperparameter optimization in WEKA","volume":"18","author":"kotthoff","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref7","first-page":"13","article-title":"FD-Autotune: Domain-specific configuration using fast downward","author":"fawcett","year":"2011","journal-title":"Proc ICAPS Workshop Planning Learn (PAL)"},{"key":"ref49","first-page":"15","article-title":"OASC-2017: *Zilla submission","volume":"79","author":"cameron","year":"2017","journal-title":"Proc Open Algorithm Selection Challenge"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487629"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190120"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10641"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000210"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23786-7_35"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190013"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190017"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.08.007"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.01.002"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/9967387\/09920217.pdf?arnumber=9920217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T19:44:11Z","timestamp":1671479051000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9920217\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":72,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2022.3215013","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12]]}}}