{"id":"https://openalex.org/W2056433610","doi":"https://doi.org/10.1145/2460239.2460249","title":"A runtime analysis of simple hyper-heuristics","display_name":"A runtime analysis of simple hyper-heuristics","publication_year":2013,"publication_date":"2013-01-16","ids":{"openalex":"https://openalex.org/W2056433610","doi":"https://doi.org/10.1145/2460239.2460249","mag":"2056433610"},"language":"en","primary_location":{"id":"doi:10.1145/2460239.2460249","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2460239.2460249","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twelfth workshop on Foundations of genetic algorithms XII","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"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/A5026427521","display_name":"Per Kristian Lehre","orcid":"https://orcid.org/0000-0002-9521-1251"},"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":false,"raw_author_name":"Per Kristian Lehre","raw_affiliation_strings":["University of Nottingham, Nottingham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nottingham, Nottingham, United Kingdom","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020026827","display_name":"Ender \u00d6zcan","orcid":"https://orcid.org/0000-0003-0276-1391"},"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":false,"raw_author_name":"Ender \u00d6zcan","raw_affiliation_strings":["University of Nottingham, Nottingham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nottingham, Nottingham, United Kingdom","institution_ids":["https://openalex.org/I142263535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I142263535"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"97","last_page":"104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9990000128746033,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9987999796867371,"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.9630740880966187},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6235978007316589},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6071141958236694},{"id":"https://openalex.org/keywords/mixing","display_name":"Mixing (physics)","score":0.5881078243255615},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5269623398780823},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4954124689102173},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.43507134914398193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2585785686969757},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1762239634990692},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.05448642373085022}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.9630740880966187},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6235978007316589},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6071141958236694},{"id":"https://openalex.org/C138777275","wikidata":"https://www.wikidata.org/wiki/Q6884054","display_name":"Mixing (physics)","level":2,"score":0.5881078243255615},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5269623398780823},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4954124689102173},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.43507134914398193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2585785686969757},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1762239634990692},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05448642373085022},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2460239.2460249","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2460239.2460249","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twelfth workshop on Foundations of genetic algorithms XII","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/ca963471-e39b-4eb4-840f-b3c49d356d8f","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/ca963471-e39b-4eb4-840f-b3c49d356d8f","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lehre, P K & \u00d6zcan, E 2013, A runtime analysis of simple hyper-heuristics : To mix or not to mix operators. in FOGA 2013 - Proceedings of the 12th ACM Workshop on Foundations of Genetic Algorithms. pp. 97-104, 12th ACM Workshop on Foundations of Genetic Algorithms, FOGA 2013, Adelaide, SA, Australia, 16/01/13. https://doi.org/10.1145/2460239.2460249","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1956160721","display_name":null,"funder_award_id":"EP/F033214/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6414137052","display_name":null,"funder_award_id":"EP/H000968/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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1562315481","https://openalex.org/W1583024890","https://openalex.org/W1605768620","https://openalex.org/W1745341198","https://openalex.org/W1814515812","https://openalex.org/W1834614309","https://openalex.org/W1849813686","https://openalex.org/W1969577093","https://openalex.org/W1998738752","https://openalex.org/W2016700350","https://openalex.org/W2026566141","https://openalex.org/W2072441740","https://openalex.org/W2097724176","https://openalex.org/W2100137329","https://openalex.org/W2107951961","https://openalex.org/W2109101401","https://openalex.org/W2143095460","https://openalex.org/W2148770681","https://openalex.org/W2156622046","https://openalex.org/W2165220807","https://openalex.org/W2169209574","https://openalex.org/W2220797521","https://openalex.org/W2295428206","https://openalex.org/W2751862591","https://openalex.org/W3125759884","https://openalex.org/W3145128584","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W1536056491","https://openalex.org/W2041180560"],"abstract_inverted_index":{"There":[0],"is":[1,106,111],"a":[2,36],"growing":[3],"body":[4],"of":[5,10,23,39,49,65,91,96,123],"work":[6,51],"in":[7,56],"the":[8,21,44,50,57,63,115,124],"field":[9],"hyper-heuristics.":[11],"Hyper-heuristics":[12],"are":[13,59,99,131],"high":[14],"level":[15,41],"search":[16,45,80],"methodologies":[17],"that":[18,72,108],"operate":[19],"on":[20,52,86,101],"space":[22],"heuristics":[24,42,74,85],"to":[25,77],"solve":[26],"hard":[27],"computational":[28],"problems.":[29,88,104],"A":[30],"frequently":[31],"used":[32],"hyper-heuristic":[33],"framework":[34],"mixes":[35],"predefined":[37],"set":[38],"low":[40],"during":[43],"process.":[46],"While":[47],"most":[48],"such":[53],"selection":[54],"hyper-heuristics":[55,66],"literature":[58],"empirical,":[60],"we":[61],"analyse":[62],"runtime":[64],"rigorously.":[67],"Our":[68],"initial":[69],"analysis":[70],"shows":[71],"mixing":[73,90,95,109,117,129],"could":[75],"lead":[76],"exponentially":[78],"faster":[79],"than":[81],"individual":[82],"(deterministically":[83],"chosen)":[84],"chosen":[87],"Both":[89],"variation":[92],"operators":[93,110,130],"and":[94],"acceptance":[97],"criteria":[98],"investigated":[100],"some":[102,122],"selected":[103],"It":[105],"shown":[107],"only":[112],"efficient":[113],"with":[114],"right":[116],"distribution":[118],"(parameter":[119],"setting).":[120],"Additionally,":[121],"existing":[125],"adaptation":[126],"mechanisms":[127],"for":[128],"also":[132],"evaluated.":[133]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2016-06-24T00:00:00"}