{"id":"https://openalex.org/W2105878511","doi":"https://doi.org/10.1109/cec.2010.5586389","title":"Beyond No Free Lunch: Realistic algorithms for arbitrary problem classes","display_name":"Beyond No Free Lunch: Realistic algorithms for arbitrary problem classes","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2105878511","doi":"https://doi.org/10.1109/cec.2010.5586389","mag":"2105878511"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2010.5586389","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2010.5586389","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","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/A5010593676","display_name":"James A. R. Marshall","orcid":"https://orcid.org/0000-0002-1506-167X"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"James A. R. Marshall","raw_affiliation_strings":["Department of Computer Science, University of Bristol, Bristol, UK","Department of Computer Science; University of Bristol; Bristol BS8 1UB United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bristol, Bristol, UK","institution_ids":["https://openalex.org/I36234482"]},{"raw_affiliation_string":"Department of Computer Science; University of Bristol; Bristol BS8 1UB United Kingdom","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054457622","display_name":"Thomas G. Hinton","orcid":"https://orcid.org/0000-0003-1461-4647"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Thomas G. Hinton","raw_affiliation_strings":["Department of Computer Science, University of Bristol, Bristol, UK","Department of Computer Science; University of Bristol; Bristol BS8 1UB United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bristol, Bristol, UK","institution_ids":["https://openalex.org/I36234482"]},{"raw_affiliation_string":"Department of Computer Science; University of Bristol; Bristol BS8 1UB United Kingdom","institution_ids":["https://openalex.org/I36234482"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7969,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.91344096,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9994000196456909,"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.987500011920929,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6463946104049683},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4618360996246338}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6463946104049683},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4618360996246338}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2010.5586389","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2010.5586389","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W67550657","https://openalex.org/W1923693611","https://openalex.org/W1969680573","https://openalex.org/W1977945115","https://openalex.org/W2070505903","https://openalex.org/W2095412422","https://openalex.org/W2100483895","https://openalex.org/W2118610447","https://openalex.org/W2135625884","https://openalex.org/W2140797335","https://openalex.org/W2143581805","https://openalex.org/W2151554678","https://openalex.org/W2157118346","https://openalex.org/W4236270875"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"In":[0],"this":[1,59,107],"paper":[2],"we":[3,61,144],"present":[4],"a":[5,39,65,86,89,129],"simple":[6,66,159],"and":[7,33,54,152,160],"general":[8],"new":[9,40,163],"No":[10,164],"Free":[11,165],"Lunch-like":[12,166],"result":[13,167],"that":[14,68,91,112,146],"applies":[15],"to":[16,42,110,182,188,208],"revisiting":[17],"algorithms":[18,50,70],"searching":[19],"arbitrary":[20,82,101,104,183],"problem":[21,105,122,131],"sets.":[22],"We":[23,36],"begin":[24],"by":[25,117],"unifying":[26],"the":[27,95,138,141,171,191,198],"assumptions":[28],"of":[29,88,194],"closure":[30],"under":[31],"permutation":[32],"non-revisiting":[34,92],"algorithms.":[35,213],"then":[37],"propose":[38],"approach":[41,60,156],"reasoning":[43],"about":[44,126,137],"search":[45,49,69,212],"algorithm":[46,119],"performance,":[47],"treating":[48],"as":[51],"stochastic":[52],"processes":[53],"thereby":[55],"admitting":[56],"revisiting;":[57],"for":[58,73,100],"need":[62],"only":[63,187],"make":[64],"assumption":[67],"are":[71],"applied":[72],"optimisation":[74],"(i.e.":[75],"maximisation":[76],"or":[77],"minimisation),":[78],"rather":[79],"than":[80,114,170,197],"considering":[81],"performance":[83,99,116,127,184],"measures.":[84],"As":[85],"consequence":[87],"proof":[90],"enumeration":[93,115,147],"has":[94,149],"best":[96],"possible":[97],"expected":[98],"distributions":[102],"over":[103],"sets,":[106],"allows":[108],"us":[109],"show":[111],"better":[113],"some":[118,121],"on":[120,128],"set":[123,132],"predicts":[124],"nothing":[125,134],"second":[130],"when":[133],"is":[135,157,168,204],"known":[136],"relation":[139],"between":[140],"two.":[142],"Finally":[143],"note":[145],"typically":[148],"excellent":[150],"time":[151],"space":[153],"complexities.":[154],"Our":[155],"both":[158,173],"powerful;":[161],"our":[162],"stronger":[169],"originals":[172,199],"in":[174,200],"its":[175,201],"predictions":[176],"and,":[177],"apart":[178],"from":[179],"not":[180],"applying":[181],"measures":[185],"but":[186],"those":[189],"reflecting":[190],"typical":[192],"goal":[193],"search,":[195],"weaker":[196],"assumptions.":[202],"It":[203],"also":[205],"directly":[206],"relevant":[207],"research":[209],"into":[210],"real-world":[211]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}