{"id":"https://openalex.org/W2127184220","doi":"https://doi.org/10.1109/cec.2006.1688679","title":"Predicting Stochastic Search Algorithm Performance using Landscape State Machines","display_name":"Predicting Stochastic Search Algorithm Performance using Landscape State Machines","publication_year":2006,"publication_date":"2006-09-22","ids":{"openalex":"https://openalex.org/W2127184220","doi":"https://doi.org/10.1109/cec.2006.1688679","mag":"2127184220"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2006.1688679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2006.1688679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Conference 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/A5081254866","display_name":"William Rowe","orcid":"https://orcid.org/0000-0002-4983-2495"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"W. Rowe","raw_affiliation_strings":["School of Chemistry, University of Manchester, Institute of Science and Technology, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Chemistry, University of Manchester, Institute of Science and Technology, UK","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061783148","display_name":"David Corne","orcid":"https://orcid.org/0000-0003-4369-3807"},"institutions":[{"id":"https://openalex.org/I32062511","display_name":"Heriot-Watt University","ror":"https://ror.org/04mghma93","country_code":"GB","type":"education","lineage":["https://openalex.org/I32062511"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"D. Corne","raw_affiliation_strings":["School of Mathematical and Computer Sciences, Heriot-Watt University, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical and Computer Sciences, Heriot-Watt University, UK","institution_ids":["https://openalex.org/I32062511"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102858903","display_name":"Joshua Knowles","orcid":"https://orcid.org/0000-0001-8112-6112"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"J. Knowles","raw_affiliation_strings":["School of Chemistry, University of Manchester, Institute of Science and Technology, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Chemistry, University of Manchester, Institute of Science and Technology, UK","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3988,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85361206,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"220","issue":null,"first_page":"2944","last_page":"2951"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9975000023841858,"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.9975000023841858,"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.996399998664856,"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/T11764","display_name":"Evolution and Genetic Dynamics","score":0.9348999857902527,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7093867063522339},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.6565027832984924},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.622850775718689},{"id":"https://openalex.org/keywords/fitness-landscape","display_name":"Fitness landscape","score":0.6090766787528992},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.579525887966156},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5734770894050598},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5328617095947266},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.5170593857765198},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5081114768981934},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4856330454349518},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4774918258190155},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.47114816308021545},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.44098642468452454},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2926902770996094},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.23541414737701416},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.16676470637321472}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7093867063522339},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.6565027832984924},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.622850775718689},{"id":"https://openalex.org/C91852762","wikidata":"https://www.wikidata.org/wiki/Q3307742","display_name":"Fitness landscape","level":3,"score":0.6090766787528992},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.579525887966156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5734770894050598},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5328617095947266},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5170593857765198},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5081114768981934},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4856330454349518},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4774918258190155},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.47114816308021545},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.44098642468452454},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2926902770996094},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.23541414737701416},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.16676470637321472},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2006.1688679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2006.1688679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Conference on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/4aec6761-03c5-4ee9-bc4e-d48e14aa9601","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/4aec6761-03c5-4ee9-bc4e-d48e14aa9601","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Rowe, W, Corne, D & Knowles, J 2006, Predicting stochastic search algorithm performance using landscape state machines. in 2006 IEEE Congress on Evolutionary Computation, CEC 2006., 1688679, 2006 IEEE Congress on Evolutionary Computation, CEC 2006, pp. 2944-2951, 2006 IEEE Congress on Evolutionary Computation, CEC 2006, Vancouver, BC, Canada, 16/07/06.","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6899999976158142,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W129986153","https://openalex.org/W1480936263","https://openalex.org/W1519597478","https://openalex.org/W1539029852","https://openalex.org/W1600919542","https://openalex.org/W1778559365","https://openalex.org/W1969857637","https://openalex.org/W2022430687","https://openalex.org/W2024060531","https://openalex.org/W2061092014","https://openalex.org/W2093320882","https://openalex.org/W2102258286","https://openalex.org/W2138309709","https://openalex.org/W2142146559","https://openalex.org/W2146879413","https://openalex.org/W2151554678","https://openalex.org/W2395284556","https://openalex.org/W6605187603","https://openalex.org/W6631259609","https://openalex.org/W6632201573","https://openalex.org/W6635738176","https://openalex.org/W6638152936"],"related_works":["https://openalex.org/W4393363920","https://openalex.org/W4322621737","https://openalex.org/W1984474632","https://openalex.org/W4248744973","https://openalex.org/W4383700488","https://openalex.org/W4287780535","https://openalex.org/W2303442355","https://openalex.org/W2093083775","https://openalex.org/W3046481193","https://openalex.org/W2168643276"],"abstract_inverted_index":{"A":[0],"Landscape":[1],"State":[2],"Machine":[3],"(LSM)":[4],"is":[5,29,157],"a":[6,23,93,139,148,153],"Markov":[7],"model":[8,65],"describing":[9],"the":[10,14,66,73,107,119,133,143,162],"transition":[11],"probabilities":[12],"between":[13],"fitness":[15,60],"`":[16],"levels'":[17],"of":[18,58,68,92,109,132,164,170],"an":[19,40,42],"optimization":[20,33],"problem,":[21],"when":[22],"given":[24,74],"neighbourhood":[25,75],"(or":[26],"mutation)":[27],"operator":[28],"applied.":[30],"Although":[31],"most":[32],"problems":[34,125],"cannot":[35],"be":[36,47,53,136],"modeled":[37],"precisely":[38],"by":[39,49,88],"LSM,":[41],"approximate":[43],"LSM":[44,120,134,150],"can":[45,52,104,135],"always":[46],"constructed":[48,87,151],"sampling,":[50],"and":[51,116],"used,":[54],"subsequently,":[55],"in":[56,62,99],"place":[57],"real":[59],"evaluations":[61],"order":[63],"to":[64,128,141,159],"performance":[67,108,163],"any":[69],"search":[70,165],"algorithm":[71],"using":[72,152],"operator.":[76],"In":[77],"this":[78,171],"paper,":[79],"we":[80],"provide":[81],"empirical":[82],"evidence":[83],"that":[84],"(a)":[85],"LSMs":[86,103],"simulated":[89],"annealing-based":[90],"sampling":[91,144],"problem":[94],"landscape":[95],"make":[96],"accurate":[97],"models":[98],"few":[100],"evaluations;":[101],"(b)":[102],"accurately":[105,160],"rank":[106,161],"diverse":[110,124],"algorithms":[111,166],"including":[112],"EAs":[113],"with/without":[114],"niching":[115],"SA;":[117],"(c)":[118],"approach":[121],"works":[122],"on":[123],"from":[126],"MAX-SAT":[127],"NKp;":[129],"(d)":[130],"convergence":[131],"used":[137],"as":[138],"guide":[140],"stopping":[142],"phase;":[145],"and,":[146],"(e)":[147],"single":[149],"low":[154],"mutation-rate":[155],"sample":[156],"sufficient":[158],"run":[167],"at":[168],"multiples":[169],"mutation":[172],"rate.":[173]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}