{"id":"https://openalex.org/W3035262131","doi":"https://doi.org/10.1145/3377930.3390189","title":"Towards dynamic algorithm selection for numerical black-box optimization","display_name":"Towards dynamic algorithm selection for numerical black-box optimization","publication_year":2020,"publication_date":"2020-06-25","ids":{"openalex":"https://openalex.org/W3035262131","doi":"https://doi.org/10.1145/3377930.3390189","mag":"3035262131"},"language":"en","primary_location":{"id":"doi:10.1145/3377930.3390189","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3377930.3390189","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2006.06586","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Diederick Vermetten","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Diederick Vermetten","raw_affiliation_strings":["Leiden Institute for Advanced Computer Science, Leiden, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Leiden Institute for Advanced Computer Science, Leiden, The Netherlands","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Hao Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Hao Wang","raw_affiliation_strings":["Sorbonne Universit\u00e9, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sorbonne Universit\u00e9, Paris, France","institution_ids":["https://openalex.org/I39804081"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Thomas B\u00e4ck","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas B\u00e4ck","raw_affiliation_strings":["Leiden Institute for Advanced Computer Science, Leiden, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Leiden Institute for Advanced Computer Science, Leiden, The Netherlands","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Carola Doerr","orcid":null},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Carola Doerr","raw_affiliation_strings":["Sorbonne Universit\u00e9, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sorbonne Universit\u00e9, Paris, France","institution_ids":["https://openalex.org/I39804081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0833,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.82587151,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"654","last_page":"662"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9995999932289124,"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.9995999932289124,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9994999766349792,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/swap","display_name":"Swap (finance)","score":0.58160001039505},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5508000254631042},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5339000225067139},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5152000188827515},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5095999836921692},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.46779999136924744},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.44429999589920044},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42649999260902405}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6736000180244446},{"id":"https://openalex.org/C99821215","wikidata":"https://www.wikidata.org/wiki/Q1136583","display_name":"Swap (finance)","level":2,"score":0.58160001039505},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5508000254631042},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5339000225067139},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5152000188827515},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5095999836921692},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47620001435279846},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.46779999136924744},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.44429999589920044},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42649999260902405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4007999897003174},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.39410001039505005},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.3928999900817871},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.3716000020503998},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.3513999879360199},{"id":"https://openalex.org/C94966114","wikidata":"https://www.wikidata.org/wiki/Q29256","display_name":"Black box","level":2,"score":0.32170000672340393},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.31040000915527344},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.3019999861717224},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2971999943256378},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28110000491142273},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.27090001106262207},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.26350000500679016}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3377930.3390189","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3377930.3390189","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2006.06586","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2006.06586","pdf_url":"https://arxiv.org/pdf/2006.06586","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-02871952v1","is_oa":true,"landing_page_url":"https://hal.sorbonne-universite.fr/hal-02871952","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Genetic and Evolutionary Computation Conference (GECCO'20), Jul 2020, Cancun, Mexico. ⟨10.1145/3377930.3390189⟩","raw_type":"Conference papers"},{"id":"pmh:oai:scholarlypublications.universiteitleiden.nl:item_3631599","is_oa":false,"landing_page_url":"https://hdl.handle.net/1887/3631599","pdf_url":null,"source":{"id":"https://openalex.org/S4306400850","display_name":"Leiden Repository (Leiden University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I121797337","host_organization_name":"Leiden University","host_organization_lineage":["https://openalex.org/I121797337"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"GECCO '20: Proceedings of the 2020 genetic and evolutionary computation conference companion","raw_type":"Article in monograph or in proceedings"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2006.06586","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2006.06586","pdf_url":"https://arxiv.org/pdf/2006.06586","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W32539537","https://openalex.org/W146022820","https://openalex.org/W243319620","https://openalex.org/W1503296932","https://openalex.org/W2000552702","https://openalex.org/W2002731955","https://openalex.org/W2024372894","https://openalex.org/W2030864341","https://openalex.org/W2063966510","https://openalex.org/W2072441740","https://openalex.org/W2086613604","https://openalex.org/W2101677491","https://openalex.org/W2102539288","https://openalex.org/W2112036188","https://openalex.org/W2118044993","https://openalex.org/W2146879413","https://openalex.org/W2150337126","https://openalex.org/W2208154600","https://openalex.org/W2219036994","https://openalex.org/W2526296895","https://openalex.org/W2588875990","https://openalex.org/W2732736182","https://openalex.org/W2768617563","https://openalex.org/W2793821014","https://openalex.org/W2888117837","https://openalex.org/W2938868012","https://openalex.org/W2951665692","https://openalex.org/W2957322520","https://openalex.org/W2957867569","https://openalex.org/W3039634465"],"related_works":[],"abstract_inverted_index":{"One":[0],"of":[1,15,38],"the":[2,33,39,53,70,74,78,136,140,173],"most":[3],"challenging":[4],"problems":[5],"in":[6,85,89,159,168,180],"evolutionary":[7],"computation":[8],"is":[9,30],"to":[10,68],"select":[11],"from":[12,139],"its":[13],"family":[14],"diverse":[16],"solvers":[17],"one":[18],"that":[19,35,95,125,149,172],"performs":[20],"well":[21],"on":[22,118,128],"a":[23,122,177],"given":[24],"problem.":[25],"This":[26],"algorithm":[27,54,61,76,98],"selection":[28,154],"problem":[29],"complicated":[31],"by":[32,52,105,120],"fact":[34],"different":[36,43,131],"phases":[37],"optimization":[40],"process":[41],"require":[42],"search":[44],"behavior.":[45],"While":[46],"this":[47,96,111],"can":[48,64,101,156,175],"partly":[49],"be":[50,66,103],"controlled":[51],"itself,":[55],"there":[56],"exist":[57],"large":[58],"differences":[59],"between":[60,130],"performance.":[62],"It":[63],"therefore":[65],"beneficial":[67],"swap":[69],"configuration":[71,99,108],"or":[72],"even":[73,150],"entire":[75],"during":[77],"run.":[79],"Long":[80],"deemed":[81],"impractical,":[82],"recent":[83],"advances":[84],"Machine":[86],"Learning":[87],"and":[88,170],"exploratory":[90],"landscape":[91],"analysis":[92],"give":[93],"hope":[94],"dynamic":[97,152],"(dynAC)":[100],"eventually":[102],"solved":[104],"automatically":[106],"trained":[107],"schedules.":[109],"With":[110],"work":[112],"we":[113,147],"aim":[114],"at":[115],"promoting":[116],"research":[117],"dynAC,":[119],"introducing":[121],"simpler":[123],"variant":[124],"focuses":[126],"only":[127],"switching":[129],"algorithms,":[132],"not":[133],"configurations.":[134],"Using":[135],"rich":[137],"data":[138],"Black":[141],"Box":[142],"Optimization":[143],"Benchmark":[144],"(BBOB)":[145],"platform,":[146],"show":[148],"single-switch":[151],"Algorithm":[153],"(dynAS)":[155],"potentially":[157],"result":[158],"significant":[160],"performance":[161],"gains.":[162],"We":[163],"also":[164],"discuss":[165],"key":[166],"challenges":[167],"dynAS,":[169],"argue":[171],"BBOB-framework":[174],"become":[176],"useful":[178],"tool":[179],"overcoming":[181],"these.":[182]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2020-06-19T00:00:00"}