{"id":"https://openalex.org/W2900641433","doi":"https://doi.org/10.1162/evco_a_00258","title":"Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes","display_name":"Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes","publication_year":2019,"publication_date":"2019-05-23","ids":{"openalex":"https://openalex.org/W2900641433","doi":"https://doi.org/10.1162/evco_a_00258","mag":"2900641433","pmid":"https://pubmed.ncbi.nlm.nih.gov/31120773"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00258","is_oa":true,"landing_page_url":"https://doi.org/10.1162/evco_a_00258","pdf_url":"https://direct.mit.edu/evco/article-pdf/28/3/437/1858940/evco_a_00258.pdf","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":true,"oa_status":"bronze","oa_url":"https://direct.mit.edu/evco/article-pdf/28/3/437/1858940/evco_a_00258.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060822830","display_name":"Andrei Lissovoi","orcid":null},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Andrei Lissovoi","raw_affiliation_strings":["Department of Computer Science, University of Sheffield, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Sheffield, UK","institution_ids":["https://openalex.org/I91136226"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063001475","display_name":"Pietro S. Oliveto","orcid":"https://orcid.org/0000-0001-8164-6767"},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Pietro S. Oliveto","raw_affiliation_strings":["Department of Computer Science, University of Sheffield, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Sheffield, UK","institution_ids":["https://openalex.org/I91136226"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035806216","display_name":"John Alasdair Warwicker","orcid":"https://orcid.org/0000-0002-6274-2638"},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"John Alasdair Warwicker","raw_affiliation_strings":["Department of Computer Science, University of Sheffield, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Sheffield, UK","institution_ids":["https://openalex.org/I91136226"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035806216","https://openalex.org/A5060822830","https://openalex.org/A5063001475"],"corresponding_institution_ids":["https://openalex.org/I91136226"],"apc_list":null,"apc_paid":null,"fwci":3.6709,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.9433676,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"28","issue":"3","first_page":"437","last_page":"461"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8613401651382446},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6051930785179138},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5754761695861816},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.561484158039093},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4882347881793976},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.45940083265304565},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.417648583650589},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.41255927085876465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3924539387226105},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3276834487915039}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8613401651382446},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6051930785179138},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5754761695861816},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.561484158039093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4882347881793976},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.45940083265304565},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.417648583650589},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.41255927085876465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3924539387226105},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3276834487915039},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[{"descriptor_ui":"D000067508","descriptor_name":"Computer Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000067508","descriptor_name":"Computer Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000067508","descriptor_name":"Computer Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000069550","descriptor_name":"Machine Learning","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D000069550","descriptor_name":"Machine Learning","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D000069550","descriptor_name":"Machine Learning","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"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":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D019985","descriptor_name":"Benchmarking","qualifier_ui":"Q000706","qualifier_name":"statistics & numerical data","is_major_topic":false},{"descriptor_ui":"D057386","descriptor_name":"Search Engine","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D057386","descriptor_name":"Search Engine","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D057386","descriptor_name":"Search Engine","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false}],"locations_count":3,"locations":[{"id":"doi:10.1162/evco_a_00258","is_oa":true,"landing_page_url":"https://doi.org/10.1162/evco_a_00258","pdf_url":"https://direct.mit.edu/evco/article-pdf/28/3/437/1858940/evco_a_00258.pdf","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:31120773","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/31120773","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:eprints.lancs.ac.uk:237840","is_oa":false,"landing_page_url":"https://eprints.lancs.ac.uk/id/eprint/237840/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401916","display_name":"Lancaster EPrints (Lancaster University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67415387","host_organization_name":"Lancaster University","host_organization_lineage":["https://openalex.org/I67415387"],"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":"Journal Article"}],"best_oa_location":{"id":"doi:10.1162/evco_a_00258","is_oa":true,"landing_page_url":"https://doi.org/10.1162/evco_a_00258","pdf_url":"https://direct.mit.edu/evco/article-pdf/28/3/437/1858940/evco_a_00258.pdf","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1926982139","display_name":null,"funder_award_id":"1665907","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G2972198855","display_name":"Rigorous Runtime Analysis of Bio-Inspired Computing","funder_award_id":"EP/M004252/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8501742012","display_name":null,"funder_award_id":"EP/M004252/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W139482607","https://openalex.org/W1502620236","https://openalex.org/W1526420097","https://openalex.org/W1526726828","https://openalex.org/W1561827681","https://openalex.org/W1562315481","https://openalex.org/W1793635223","https://openalex.org/W1849813686","https://openalex.org/W1983829510","https://openalex.org/W2012697403","https://openalex.org/W2026566141","https://openalex.org/W2027964569","https://openalex.org/W2035300004","https://openalex.org/W2056433610","https://openalex.org/W2056956492","https://openalex.org/W2072441740","https://openalex.org/W2082931571","https://openalex.org/W2087605480","https://openalex.org/W2091244131","https://openalex.org/W2140759234","https://openalex.org/W2143095460","https://openalex.org/W2147148915","https://openalex.org/W2151554678","https://openalex.org/W2161238506","https://openalex.org/W2186836389","https://openalex.org/W2264646800","https://openalex.org/W2347027478","https://openalex.org/W2499149626","https://openalex.org/W2504494713","https://openalex.org/W2518633304","https://openalex.org/W2599523157","https://openalex.org/W2600130231","https://openalex.org/W2618603578","https://openalex.org/W2725019750","https://openalex.org/W2743438247","https://openalex.org/W2770281661","https://openalex.org/W2797555254","https://openalex.org/W2875338278","https://openalex.org/W2887049521","https://openalex.org/W2887325363","https://openalex.org/W2904037980","https://openalex.org/W2912410714","https://openalex.org/W2923219017","https://openalex.org/W2954834840","https://openalex.org/W2964093760","https://openalex.org/W3125759884","https://openalex.org/W4239703783","https://openalex.org/W4292933845","https://openalex.org/W4300060415"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W3143937874","https://openalex.org/W4312926500","https://openalex.org/W2067280619","https://openalex.org/W4251343851","https://openalex.org/W4352977312"],"abstract_inverted_index":{"Selection":[0],"hyper-heuristics":[1],"(HHs)":[2],"are":[3,50,340],"randomised":[4],"search":[5,273,289],"methodologies":[6],"which":[7,31],"choose":[8,276],"and":[9,70,90,317,360],"execute":[10],"heuristics":[11,245,274],"during":[12,227],"the":[13,63,68,76,84,100,109,115,118,127,147,152,161,179,208,218,228,237,243,261,264,268,293,300,309,326,332,365,369],"optimisation":[14,175],"process":[15],"from":[16,67,108,277],"a":[17,142,155,169,173,190,200,231],"set":[18],"of":[19,97,112,193,199,221,263,270,299,311],"low-level":[20,32,113,244,271,287],"heuristics.":[21,304],"A":[22],"machine":[23],"learning":[24,48,144],"mechanism":[25,145],"is":[26,122,135,139,158,164,329,335],"generally":[27],"used":[28],"to":[29,55,106,123,125,172,216,225,254,275,283,356],"decide":[30],"heuristic":[33,130,157],"should":[34],"be":[35,187],"applied":[36],"in":[37,160,374],"each":[38],"decision":[39],"step.":[40],"In":[41,279],"this":[42,59],"article,":[43],"we":[44,61,205,233,306],"analyse":[45,72],"whether":[46],"sophisticated":[47],"mechanisms":[49],"always":[51],"necessary":[52],"for":[53,75,351,368],"HHs":[54,66,93,102],"perform":[56],"well.":[57],"To":[58],"end":[60],"consider":[62],"most":[64],"simple":[65],"literature":[69],"rigorously":[71],"their":[73],"performance":[74,111,240,262,328,333],"LeadingOnes":[77,204],"benchmark":[78],"function.":[79],"Our":[80],"analysis":[81],"shows":[82],"that":[83,154,207,260,308],"standard":[85,321],"Simple":[86],"Random,":[87],"Permutation,":[88],"Greedy,":[89],"Random":[91,119,181,210],"Gradient":[92,120,182,211],"show":[94,307],"no":[95],"signs":[96],"learning.":[98],"While":[99],"former":[101],"do":[103],"not":[104],"attempt":[105],"learn":[107,215],"past":[110],"heuristics,":[114,290],"idea":[116],"behind":[117],"HH":[121,183,213,265],"continue":[124],"exploit":[126],"currently":[128],"selected":[129],"as":[131,133,267],"long":[132],"it":[134,138,235,291],"successful.":[136],"Hence,":[137],"embedded":[140],"with":[141,146,242,249,281],"reinforcement":[143],"shortest":[148],"possible":[149,239],"memory.":[150],"However,":[151],"probability":[153],"promising":[156],"successful":[159],"next":[162],"step":[163],"relatively":[165],"low":[166],"when":[167],"perturbing":[168],"reasonable":[170],"solution":[171],"combinatorial":[174],"problem.":[176],"We":[177,257],"generalise":[178],"\u201csimple\u201d":[180],"so":[184],"success":[185],"can":[186,214],"measured":[188],"over":[189,313],"fixed":[191],"period":[192],"time":[194],"[Formula:":[195,284,301,357,371],"see":[196,285,302,358,372],"text],":[197],"instead":[198],"single":[201],"iteration.":[202],"For":[203],"prove":[206,234,259],"Generalised":[209],"(GRG)":[212],"adapt":[217],"neighbourhood":[219,251],"size":[220],"Randomised":[222,314],"Local":[223,247,315],"Search":[224,248,316],"optimality":[226],"run.":[229],"As":[230],"result,":[232],"has":[236],"best":[238,366],"achievable":[241],"(Randomised":[246],"different":[250,352],"sizes),":[252],"up":[253],"lower-order":[255],"terms.":[256],"also":[258],"improves":[266],"number":[269],"local":[272,288],"increases.":[278],"particular,":[280],"access":[282],"text]":[286,303,373],"outperforms":[292],"best-possible":[294],"algorithm":[295],"using":[296,320],"any":[297],"subset":[298],"Finally,":[305],"advantages":[310],"GRG":[312],"Evolutionary":[318],"Algorithms":[319],"bit":[322],"mutation":[323],"increase":[324],"if":[325,337],"anytime":[327],"considered":[330],"(i.e.,":[331],"gap":[334],"larger":[336],"approximate":[338],"solutions":[339],"sought":[341],"rather":[342],"than":[343],"exact":[344],"ones).":[345],"Experimental":[346],"analyses":[347],"confirm":[348],"these":[349],"results":[350],"problem":[353],"sizes":[354],"(up":[355],"text])":[359],"shed":[361],"some":[362],"light":[363],"on":[364],"choices":[367],"parameter":[370],"various":[375],"situations.":[376]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2018-11-29T00:00:00"}