{"id":"https://openalex.org/W2002315336","doi":"https://doi.org/10.1162/evco_e_00091","title":"Benchmarking of Continuous Black Box Optimization Algorithms","display_name":"Benchmarking of Continuous Black Box Optimization Algorithms","publication_year":2012,"publication_date":"2012-11-19","ids":{"openalex":"https://openalex.org/W2002315336","doi":"https://doi.org/10.1162/evco_e_00091","mag":"2002315336","pmid":"https://pubmed.ncbi.nlm.nih.gov/23163805"},"language":"en","primary_location":{"id":"doi:10.1162/evco_e_00091","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_e_00091","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5105003046","display_name":"Anne Auger","orcid":"https://orcid.org/0009-0008-0912-2764"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Anne Auger","raw_affiliation_strings":["INRIA, France"],"affiliations":[{"raw_affiliation_string":"INRIA, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039669927","display_name":"Nikolaus Hansen","orcid":"https://orcid.org/0000-0001-7788-4906"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nikolaus Hansen","raw_affiliation_strings":["INRIA, France"],"affiliations":[{"raw_affiliation_string":"INRIA, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081938847","display_name":"Marc Schoenauer","orcid":"https://orcid.org/0000-0003-1450-6830"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Marc Schoenauer","raw_affiliation_strings":["INRIA, France"],"affiliations":[{"raw_affiliation_string":"INRIA, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5105003046"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":4.1088,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.93125228,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"20","issue":"4","first_page":"481","last_page":"481"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.45350000262260437,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.45350000262260437,"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/benchmarking","display_name":"Benchmarking","score":0.9014996290206909},{"id":"https://openalex.org/keywords/black-box","display_name":"Black box","score":0.7246761918067932},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5313525795936584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5157737731933594},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.479645311832428},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.4428308606147766},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28878629207611084},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1739194691181183},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.06158202886581421}],"concepts":[{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.9014996290206909},{"id":"https://openalex.org/C94966114","wikidata":"https://www.wikidata.org/wiki/Q29256","display_name":"Black box","level":2,"score":0.7246761918067932},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5313525795936584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5157737731933594},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.479645311832428},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.4428308606147766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28878629207611084},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1739194691181183},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.06158202886581421},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D019985","descriptor_name":"Benchmarking","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D019985","descriptor_name":"Benchmarking","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D019985","descriptor_name":"Benchmarking","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false}],"locations_count":2,"locations":[{"id":"doi:10.1162/evco_e_00091","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_e_00091","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:23163805","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/23163805","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4366549320","https://openalex.org/W4287863136","https://openalex.org/W3006015132","https://openalex.org/W2965078190","https://openalex.org/W3040644038","https://openalex.org/W4311207076","https://openalex.org/W2140656843","https://openalex.org/W4313459248","https://openalex.org/W3203633096","https://openalex.org/W2355226480"],"abstract_inverted_index":{"Benchmarking":[0,24,125],"of":[1,11,64,88,174,185,209],"optimization":[2,53],"algorithms":[3],"is":[4],"necessary":[5],"to":[6,14,46,99,182,190,205,246],"quantitatively":[7],"assess":[8],"the":[9,36,79,137,149,186,191,197,227,238],"performance":[10,105],"optimizers":[12],"and":[13,18,33,38,50,67,73,95,103,114,141,169,215,253,265],"understand":[15],"their":[16,200,251],"strengths":[17],"weaknesses.":[19],"The":[20,217],"Black":[21,122],"Box":[22,123],"Optimization":[23,124],"(BBOB)":[25],"workshops":[26],"that":[27,81,128],"took":[28],"place":[29],"in":[30,158,165,220,248],"2009,":[31],"2010,":[32],"2012":[34],"during":[35,136],"Genetic":[37],"Evolutionary":[39,210],"Computation":[40],"Conference":[41],"(GECCO)":[42],"were":[43,71,146,160],"set":[44,63],"up":[45],"benchmark":[47],"both":[48],"stochastic":[49],"deterministic":[51],"continuous":[52],"algorithms.":[54],"For":[55],"this":[56,166,221],"purpose,":[57],"a":[58,62,68,177],"thorough":[59],"experimental":[60],"setting,":[61],"test":[65,83],"functions,":[66],"visualization":[69],"tool":[70,111,232],"designed":[72],"provided.":[74],"They":[75],"are":[76,129,163,203],"based":[77,132],"on":[78,121,133,226],"idea":[80],"(i)":[82],"functions":[84],"should":[85,107],"be":[86,108],"representative":[87],"typical":[89],"known":[90],"difficulties,":[91],"scalable":[92],"with":[93],"dimension,":[94],"not":[96],"too":[97],"easy":[98],"solve,":[100],"yet":[101],"comprehensible;":[102],"(ii)":[104],"measures":[106],"quantitative.":[109],"A":[110],"for":[112,188,199,212,250],"acquiring":[113],"postprocessing":[115],"data":[116],"was":[117],"provided.This":[118],"special":[119,167,192,222],"issue":[120,168,193,223],"contains":[126],"papers":[127,157,171],"extensions":[130],"or":[131],"results":[134],"obtained":[135],"BBOB":[138,239],"GECCO":[139],"2009":[140],"2010":[142],"workshops.":[143],"All":[144],"articles":[145],"selected":[147],"after":[148],"standard":[150],"rigorous":[151],"review":[152],"process,":[153],"from":[154],"which":[155,242],"seven":[156],"total":[159],"selected;":[161],"five":[162],"published":[164],"two":[170],"will":[172],"appear\u2013because":[173],"space":[175],"reasons\u2013in":[176],"regular":[178],"issue.We":[179],"would":[180,244],"like":[181,245],"thank":[183,247],"all":[184],"authors":[187],"contributing":[189],"as":[194,196],"well":[195],"reviewers":[198],"reviews.":[201],"We":[202],"indebted":[204],"Hans-Georg":[206],"Beyer,":[207],"Editor-in-Chief":[208],"Computation,":[211],"his":[213],"patience":[214],"support.":[216],"works":[218],"presented":[219],"rely":[224],"heavily":[225],"Comparing":[228],"Continuous":[229],"Optimizer":[230],"(COCO)":[231],"continuously":[233],"developed":[234],"since":[235],"2008":[236],"by":[237],"team":[240],"among":[241],"we":[243],"particular":[249],"work":[252],"enthusiasm":[254],"Raymond":[255],"Ros,":[256],"Steffen":[257],"Finck,":[258],"Petr":[259],"Po.\u0161\u00ec.k,":[260],"Mike":[261],"Preuss,":[262],"Olaf":[263],"Mersmann,":[264],"Verena":[266],"Heidrich-Meisner.":[267]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}