{"id":"https://openalex.org/W2054281842","doi":"https://doi.org/10.1162/evco_e_00071","title":"Editorial for the Special Issue on Automated Design and Assessment of Heuristic Search Methods","display_name":"Editorial for the Special Issue on Automated Design and Assessment of Heuristic Search Methods","publication_year":2012,"publication_date":"2012-05-07","ids":{"openalex":"https://openalex.org/W2054281842","doi":"https://doi.org/10.1162/evco_e_00071","mag":"2054281842","pmid":"https://pubmed.ncbi.nlm.nih.gov/22564097"},"language":"en","primary_location":{"id":"doi:10.1162/evco_e_00071","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_e_00071","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":"editorial","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1887/75305","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090624529","display_name":"Gabriela Ochoa","orcid":"https://orcid.org/0000-0001-7649-5669"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Gabriela Ochoa","raw_affiliation_strings":["School of Computer Science, University of Nottingham, Nottingham, UK"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Nottingham, Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062774048","display_name":"Mike Preu\u00df","orcid":"https://orcid.org/0000-0003-4681-1346"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Mike Preuss","raw_affiliation_strings":["Department of Computer Science, TU Dortmund, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020539256","display_name":"Thomas Bartz\u2013Beielstein","orcid":"https://orcid.org/0000-0002-5938-5158"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas Bartz-Beielstein","raw_affiliation_strings":["Department of Computer Science, Fachhochschule K\u00f6ln, Gummersbach, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Fachhochschule K\u00f6ln, Gummersbach, Germany","institution_ids":[]}]},{"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/I4210126360","display_name":"Inria Saclay - \u00cele de France","ror":"https://ror.org/0315e5x55","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]},{"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 Saclay - \u00cele-de-France, France"],"affiliations":[{"raw_affiliation_string":"INRIA Saclay - \u00cele-de-France, France","institution_ids":["https://openalex.org/I4210126360","https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5090624529"],"corresponding_institution_ids":["https://openalex.org/I142263535"],"apc_list":null,"apc_paid":null,"fwci":0.4458,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.72846695,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"20","issue":"2","first_page":"161","last_page":"163"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/heuristics","display_name":"Heuristics","score":0.8647943139076233},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7640615701675415},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7361337542533875},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.6340818405151367},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.5405347347259521},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.4706617593765259},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4026668965816498},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.39288264513015747},{"id":"https://openalex.org/keywords/management-science","display_name":"Management science","score":0.38737523555755615},{"id":"https://openalex.org/keywords/industrial-engineering","display_name":"Industrial engineering","score":0.35242462158203125},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.34677091240882874},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.34365570545196533},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21104854345321655},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09619641304016113},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09483850002288818},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.07944226264953613}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8647943139076233},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7640615701675415},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7361337542533875},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.6340818405151367},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.5405347347259521},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.4706617593765259},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4026668965816498},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.39288264513015747},{"id":"https://openalex.org/C539667460","wikidata":"https://www.wikidata.org/wiki/Q2414942","display_name":"Management science","level":1,"score":0.38737523555755615},{"id":"https://openalex.org/C13736549","wikidata":"https://www.wikidata.org/wiki/Q4489420","display_name":"Industrial engineering","level":1,"score":0.35242462158203125},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.34677091240882874},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.34365570545196533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21104854345321655},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09619641304016113},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09483850002288818},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.07944226264953613},{"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/C188888258","wikidata":"https://www.wikidata.org/wiki/Q7353390","display_name":"Robot learning","level":4,"score":0.0},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"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":"D001185","descriptor_name":"Artificial Intelligence","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D001185","descriptor_name":"Artificial Intelligence","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D001185","descriptor_name":"Artificial Intelligence","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D008490","descriptor_name":"Medical Informatics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D008490","descriptor_name":"Medical Informatics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D008490","descriptor_name":"Medical Informatics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D013223","descriptor_name":"Statistics as Topic","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D013223","descriptor_name":"Statistics as Topic","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D013223","descriptor_name":"Statistics as Topic","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D016247","descriptor_name":"Information Storage and Retrieval","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D016247","descriptor_name":"Information Storage and Retrieval","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D016247","descriptor_name":"Information Storage and Retrieval","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D048088","descriptor_name":"Informatics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D048088","descriptor_name":"Informatics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D048088","descriptor_name":"Informatics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false}],"locations_count":4,"locations":[{"id":"doi:10.1162/evco_e_00071","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_e_00071","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:22564097","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/22564097","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},{"id":"pmh:oai:scholarlypublications.universiteitleiden.nl:item_2973899","is_oa":false,"landing_page_url":"https://hdl.handle.net/1887/75305","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":"Evolutionary Computation","raw_type":"Article / Letter to editor"},{"id":"pmh:ul:oai:scholarlypublications.universiteitleiden.nl:item_2973899","is_oa":true,"landing_page_url":"http://hdl.handle.net/1887/75305","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"Evolutionary Computation, 20(2), 161 - 163. MIT PRESS","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:ul:oai:scholarlypublications.universiteitleiden.nl:item_2973899","is_oa":true,"landing_page_url":"http://hdl.handle.net/1887/75305","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"Evolutionary Computation, 20(2), 161 - 163. MIT PRESS","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1814515812","https://openalex.org/W1977474365","https://openalex.org/W2114620686","https://openalex.org/W2117643431","https://openalex.org/W2148948822"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W2358427436","https://openalex.org/W1994919150","https://openalex.org/W4386269615","https://openalex.org/W2064794194","https://openalex.org/W2402589461","https://openalex.org/W3111117784","https://openalex.org/W4200104947","https://openalex.org/W58921990","https://openalex.org/W4322703856"],"abstract_inverted_index":{"Heuristic":[0],"search":[1,138,171,297,358,419,446,522,611,661,667,767,816,820,848,862,1267],"algorithms":[2,362,775,898],"have":[3,175,251,374,480],"been":[4,69,176,252,481,550],"successfully":[5],"applied":[6,177],"to":[7,48,71,90,93,178,254,289,351,387,391,456,459,467,474,521,529,532,559,618,640,751,763,843,853,867,894,912,1007,1017,1095,1135,1137,1226],"solve":[8],"many":[9],"problems":[10],"in":[11,18,111,198,202,504,561,582,597,635,638,698,908,936,973,1201,1256],"practice.":[12],"Their":[13,905],"design,":[14],"however,":[15],"has":[16,68,549],"increased":[17],"complexity":[19],"as":[20,137,435,1078],"the":[21,38,42,50,77,117,121,127,148,159,186,193,216,222,225,242,263,266,271,283,291,309,327,352,394,399,402,407,422,426,475,485,490,540,543,554,583,593,605,610,622,648,657,660,664,692,695,707,723,735,753,765,784,801,812,815,819,847,931,947,955,964,979,988,999,1002,1009,1012,1022,1054,1090,1096,1115,1157,1172,1193,1196,1202,1207,1211,1216,1228,1236,1252,1258],"number":[22,64,805],"of":[23,55,119,129,150,162,195,218,228,244,270,280,295,304,311,329,356,396,404,413,424,432,539,585,607,621,650,659,666,694,709,716,725,737,773,806,814,926,933,966,978,987,1011,1021,1056,1098,1114,1119,1126,1153,1156,1175,1210,1254],"parameters":[24,693],"and":[25,29,53,66,103,131,145,169,174,204,239,268,293,318,367,444,463,663,683,740,758,769,779,857,878,884,902,943,991,1001,1019,1042,1059,1064,1108,1180,1235,1242,1260,1264],"choices":[26],"for":[27,40,215,287,453,508,690,861,882,1027,1032,1171,1220,1231,1238],"operators":[28,397,457],"algorithmic":[30,134,449],"components":[31,135],"is":[32,36,191,205,299,409,527,557,776,789,1075],"also":[33,206,482,747,1085,1162],"expanding.":[34],"There":[35],"clearly":[37],"need":[39,386],"providing":[41,1086],"final":[43],"user":[44],"with":[45,671,743,855,994,1015,1030,1067,1132],"automated":[46,112,885],"tools":[47,925,1166],"assist":[49],"tuning,":[51],"design":[52,267,292,589,826],"assessment":[54,294],"heuristic":[56,113,156,296,357,766,1266],"optimisation":[57],"methods.":[58,165,247,359],"In":[59,75,383,401,421,782],"recent":[60],"years":[61],"a":[62,196,301,342,411,533,562,687,699,726,749,975,1079,1154,1199],"growing":[63],"workshops":[65],"tracks":[67],"held":[70,208],"address":[72],"these":[73,180,330,717,834],"issues.":[74,382],"2010,":[76],"Parallel":[78],"Problem":[79],"Solving":[80],"from":[81,158,258,609,811,833,869,918,1049],"Nature":[82],"(PPSN)":[83],"conference":[84],"hosted":[85],"two":[86,347,515,889,1164],"workshops,":[87],"which":[88,190,200,415,465,587,761,1148],"decided":[89],"joint":[91],"efforts":[92],"organise":[94],"this":[95,209,598,870,1221,1247],"journal":[96],"special":[97,322,1248],"issue.":[98],"The":[99,183,211,600,729,837,887,928,1160],"workshop":[100,184,213],"\u201cSelf-Tuning,":[101],"Self-Configuring":[102],"Self-Generating":[104],"Search":[105],"Heuristics,\u201d":[106],"distinguished":[107],"three":[108,181],"general":[109],"processes":[110],"design:":[114],"1)":[115],"tuning:":[116],"process":[118,128,149,612],"adjusting":[120],"algorithm's":[122],"control":[123],"parameters,":[124,742],"2)":[125],"configuring:":[126],"selecting":[130],"using":[132,489],"existing":[133,164],"such":[136,434],"operators,":[139],"construction":[140],"heuristics":[141,154,439,697,718,739,755],"or":[142,440,542,616,915,1192],"acceptance":[143],"criteria,":[144],"3)":[146],"generating:":[147],"creating":[151],"altogether":[152],"new":[153],"(or":[155],"components)":[157],"basic":[160,1046],"sub-components":[161],"previously":[163],"Machine":[166],"learning,":[167],"meta-modelling":[168],"multilevel":[170],"approaches":[172],"can":[173,234,274],"automate":[179,290],"processes.":[182],"introduced":[185],"term":[187,491],"\u2018Self-*":[188],"Search\u2019,":[189],"now":[192],"name":[194],"track":[197],"GECCO,":[199],"started":[201],"2011":[203],"being":[207],"year.":[210],"other":[212,1194],"\u201cMethods":[214],"Assessment":[217],"Computational":[219],"Systems\u201d":[220],"stressed":[221],"idea":[223],"that":[224,338,568,627,647,972,998,1167,1188],"experimental":[226,246,1173],"analysis":[227,877,986,1174],"computational":[229,259,272],"systems":[230,273],"inspired":[231],"by":[232,241,277,511,588,676,821,899,940,950,1035,1105,1151],"nature":[233,658],"be":[235,275,614,1169],"made":[236],"more":[237,778,780,1262],"sound":[238],"effective":[240],"use":[243],"appropriate":[245],"More":[248],"severe":[249],"requirements":[250],"transmitted":[253],"draw":[255],"objective":[256],"conclusions":[257],"experiments,":[260],"while":[261],"at":[262,326,469],"same":[264],"time":[265],"configuration":[269,355],"improved":[276,744],"profitable":[278],"ways":[279,893],"looking":[281],"into":[282,756,1053],"data":[284,876,917],"collected.The":[285],"quest":[286],"methods":[288,298,1048],"spawning":[300],"considerable":[302],"amount":[303],"interdisciplinary":[305],"research,":[306],"mainly":[307],"between":[308],"fields":[310],"computer":[312],"science,":[313],"artificial":[314],"intelligence,":[315],"optimization,":[316],"statistics":[317],"machine":[319],"learning.":[320],"This":[321,643],"issue":[323,602,1249],"gathers":[324],"contributions":[325],"interface":[328],"topics.":[331],"It":[332,548,746,799,864],"comprises":[333],"five":[334],"high":[335],"quality":[336],"papers":[337,890],"were":[339],"selected":[340],"after":[341],"rigorous":[343],"reviewing":[344],"process.The":[345],"first":[346,499],"articles":[348],"are":[349,416,719,828,840,907,921,924,1005,1140,1149],"related":[350,558,897],"automatic,":[353],"online":[354],"Adaptive":[360,492,505],"memetic":[361,405],"(Ong":[363],"et":[364,371,496,796],"al.,":[365,372,497,797],"2006)":[366],"selective":[368,703],"hyper-heuristics":[369,704],"(Burke":[370],"2010)":[373],"developed":[375],"separately.":[376],"However,":[377,581],"they":[378,385,962],"share":[379],"key":[380],"research":[381],"particular,":[384,783],"provide":[388],"adaptive":[389,995],"mechanisms":[390,452,479,653,750,880],"autonomously":[392],"guide":[393],"choice":[395,408,427,556,708,736],"during":[398],"search.":[400],"case":[403,423,584],"algorithms,":[406,1084,1212],"among":[410],"set":[412],"memes,":[414,586],"generally":[417],"local":[418,445,591,617,628],"heuristics.":[420,447,712],"hyper-heuristics,":[425],"may":[428],"involve":[429],"different":[430,968,1133],"types":[431],"heuristics,":[433,437,760],"constructive":[436,1240],"mutational":[438],"neighborhood":[441],"moves,":[442],"crossovers":[443],"Both":[448],"schemes":[450,630],"require":[451],"assigning":[454,519],"rewards":[455],"according":[458,473],"their":[460,632,741,1062,1232,1239],"past":[461],"performance":[462,649,1208,1259],"select":[464,706],"operator":[466,555],"apply":[468],"each":[470],"decision":[471],"point":[472],"computed":[476],"qualities.":[477],"These":[478],"studied":[483],"within":[484,1082],"evolutionary":[486,564,774,1083],"computation":[487],"community":[488],"Operator":[493],"Selection":[494],"(Fialho":[495],"2010).The":[498],"paper,":[500],"\u201cEstimating":[501],"Meme":[502],"Fitness":[503],"Memetic":[506],"Algorithms":[507,1130],"Combinatorial":[509],"Problems\u201d":[510],"J.":[512,681],"Smith":[513],"studies":[514],"fundamental":[516],"issues":[517],"when":[518,553],"credit":[520,531,651],"operators.":[523],"First,":[524],"whether":[525,604],"it":[526,546],"better":[528,579],"assign":[530],"meme":[534],"based":[535,830],"on":[536,655,831,959,1102,1117,1142],"an":[537,790],"estimate":[538],"extreme,":[541],"mean":[544],"benefit":[545],"causes.":[547],"found":[551,596],"that,":[552],"mutation":[560,727],"standard":[563],"algorithm,":[565,1195],"\u201cextremal\u201d":[566],"versions":[567],"reward":[569,629],"occasional":[570],"large":[571],"jumps":[572],"rather":[573],"than":[574],"small":[575],"steady":[576],"improvements,":[577],"produce":[578],"results.":[580,745],"cause":[590],"improvement,":[592],"opposite":[594],"was":[595],"study.":[599],"second":[601],"concerns":[603],"aggregation":[606],"feedback":[608,1241],"should":[613],"global":[615,633],"some":[619,715,1087],"part":[620],"solution":[623],"space.":[624,849],"Results":[625],"suggest":[626],"outperform":[631],"counterparts":[634],"combinatorial":[636],"spaces,":[637],"contrast":[639],"continuous":[641],"spaces.":[642],"study":[644],"therefore":[645],"confirms":[646],"assignment":[652],"depends":[654],"both":[656,881],"space":[662,768,817],"type":[665,1128],"operator.The":[668],"paper":[669,929,1024,1091],"\u201cHyper-Heuristics":[670],"Low":[672],"Level":[673],"Parameter":[674,786,938],"Adaptation\u201d":[675],"Z.":[677,684],"Ren,":[678],"H.":[679,1040],"Jiang,":[680],"Xuan,":[682],"Luo":[685],"incorporates":[686],"search-based":[688],"mechanism":[689],"adapting":[691],"low-level":[696,711,738,754],"hyper-heuristic":[700],"framework.":[701],"Traditionally,":[702],"adaptively":[705],"fixed":[710],"But":[713],"clearly,":[714],"parameterised":[720],"(for":[721],"example,":[722],"rate":[724],"operator).":[728],"proposed":[730],"framework,":[731],"then,":[732],"simultaneously":[733],"adapt":[734,1136],"proposes":[748],"separate":[752],"intensification":[757],"diversification":[759],"helps":[762],"reduce":[764],"improves":[770],"efficiency.Parameter":[771],"tuning":[772,793,871,914],"attracting":[777],"interest.":[781],"Sequential":[785,937],"Optimization":[787],"(SPO)":[788],"established":[791],"parameter":[792,913,1204],"framework":[794,949],"(Bartz-Beielstein":[795],"2005).":[798],"uses":[800],"available":[802],"budget":[803],"(e.g.,":[804],"function":[807],"evaluations)":[808],"sequentially.":[809],"Information":[810],"exploration":[813],"guides":[818],"building":[822],"meta":[823,835,838],"models.":[824,836],"New":[825],"points":[827],"determined":[829,1145],"predictions":[832],"models":[839,990],"refined":[841],"stepwise":[842],"improve":[844,895,1008],"knowledge":[845,1219],"about":[846],"SPO":[850,896,948],"provides":[851,879,981],"techniques":[852],"cope":[854],"noise":[856],"guarantees":[858],"comparable":[859],"confidence":[860],"points.":[863],"collects":[865],"information":[866],"learn":[868],"process,":[872],"e.g.,":[873],"integrated":[874],"exploratory":[875],"interactive":[883],"tuning.":[886],"following":[888],"discuss":[891],"essential":[892],"embedding":[900],"transformations":[901,923],"resampling":[903,1047],"techniques.":[904],"results":[906],"no":[909],"way":[910],"restricted":[911],"SPO.Since":[916],"optimization":[919,1177],"runs":[920],"non-normal,":[922],"choice.":[927],"\u201cOn":[930],"Effect":[932],"Response":[934],"Transformations":[935],"Optimization,\u201d":[939],"T.":[941],"Wagner":[942],"S.":[944],"Wessing":[945],"enhances":[946],"introducing":[951],"transformation":[952,977,1004],"steps":[953],"before":[954],"actual":[956],"modeling.":[957],"Based":[958,1101],"design-of-experiments":[960],"techniques,":[961],"analyze":[963],"effect":[965],"integrating":[967],"transformations.":[969],"They":[970],"demonstrate":[971],"particular":[974],"rank":[976,1000],"responses":[980],"significant":[982],"improvements.":[983],"A":[984],"deeper":[985],"resulting":[989],"additional":[992],"experiments":[993],"procedures":[996],"indicate":[997],"Box-Cox":[1003],"able":[1006],"properties":[1010,1139],"result":[1013],"distributions":[1014],"respect":[1016],"symmetry":[1018],"normality":[1020],"residuals.The":[1023],"\u201cResampling":[1025],"Methods":[1026],"Meta-Model":[1028],"Validation,":[1029],"Recommendations":[1031],"Evolutionary":[1033,1129],"Computation\u201d":[1034],"B.":[1036],"Bischl,":[1037],"O.":[1038],"Mersmann,":[1039],"Trautmann,":[1041],"C.":[1043],"Weihs":[1044],"summarizes":[1045],"statistics,":[1050],"puts":[1051],"them":[1052],"context":[1055],"meta-model":[1057],"validation":[1058,1074],"extensively":[1060],"discusses":[1061],"advantages":[1063],"disadvantages":[1065],"together":[1066],"common":[1068],"pitfalls":[1069],"users":[1070],"shall":[1071,1168],"avoid.":[1072],"Meta-model":[1073],"then":[1076],"discussed":[1077],"supportive":[1080],"technique":[1081],"concrete":[1088],"examples.Finally,":[1089],"\u201cAn":[1092],"Experimental":[1093],"Approach":[1094],"Comparison":[1097],"Continuous":[1099],"Metaheuristics":[1100],"Landscape":[1103],"Topology\u201d":[1104],"R.":[1106],"Morgan":[1107],"M.":[1109],"Gallagher":[1110],"extends":[1111],"previous":[1112],"work":[1113],"authors":[1116,1197,1230],"Max-Set":[1118],"Gaussians":[1120],"(MSG)":[1121],"problem":[1122,1138,1203],"generators.":[1123],"Two":[1124],"Estimation":[1125],"Distribution":[1127],"(EDA)":[1131],"abilities":[1134],"compared":[1141],"various":[1143],"randomly":[1144],"ridge":[1146],"landscapes,":[1147],"constructed":[1150],"means":[1152],"modification":[1155],"MSG":[1158],"generator.":[1159],"article":[1161],"suggests":[1163],"visualization":[1165],"helpful":[1170],"non-deterministic":[1176],"algorithms:":[1178],"heatmaps":[1179],"parameterized":[1181],"difference":[1182,1209],"plots.":[1183],"After":[1184],"detecting":[1185],"typical":[1186],"landscapes":[1187],"favor":[1189],"either":[1190],"one":[1191],"undertake":[1198],"meta-search":[1200],"space,":[1205],"maximizing":[1206],"thereby":[1213],"further":[1214],"enhancing":[1215],"algorithm-problem":[1217],"interaction":[1218],"case.The":[1222],"guest":[1223],"editors":[1224],"wish":[1225],"thank":[1227],"contributing":[1229],"interesting":[1233],"submissions":[1234],"reviewers":[1237],"detailed":[1243],"comments.":[1244],"We":[1245],"hope":[1246],"will":[1250],"promote":[1251],"cross-fertilisation":[1253],"ideas":[1255],"assessing":[1257],"designing":[1261],"autonomous":[1263],"user-friendly":[1265],"algorithms.":[1268]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}