{"id":"https://openalex.org/W1997104952","doi":"https://doi.org/10.1109/tevc.2011.2163638","title":"Maximum Satisfiability: Anatomy of the Fitness Landscape for a Hard Combinatorial Optimization Problem","display_name":"Maximum Satisfiability: Anatomy of the Fitness Landscape for a Hard Combinatorial Optimization Problem","publication_year":2011,"publication_date":"2011-10-17","ids":{"openalex":"https://openalex.org/W1997104952","doi":"https://doi.org/10.1109/tevc.2011.2163638","mag":"1997104952"},"language":"en","primary_location":{"id":"doi:10.1109/tevc.2011.2163638","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2011.2163638","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","raw_type":"journal-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/A5046941095","display_name":"Adam Pr\u00fcgel\u2010Bennett","orcid":"https://orcid.org/0000-0002-1329-5077"},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Adam Prugel-Bennett","raw_affiliation_strings":["School of Electronics and Computer Science, University of Southampton, Southampton, UK","Sch. of Electron. & Comput. Sci., Univ. of Southampton, Southampton, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Electronics and Computer Science, University of Southampton, Southampton, UK","institution_ids":["https://openalex.org/I43439940"]},{"raw_affiliation_string":"Sch. of Electron. & Comput. Sci., Univ. of Southampton, Southampton, UK#TAB#","institution_ids":["https://openalex.org/I43439940"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004791600","display_name":"Mohammad-Hassan Tayarani-Najaran","orcid":"https://orcid.org/0000-0002-5999-2134"},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mohammad-Hassan Tayarani-Najaran","raw_affiliation_strings":["School of Electronics and Computer Science, University of Southampton, Southampton, UK","Sch. of Electron. & Comput. Sci., Univ. of Southampton, Southampton, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Electronics and Computer Science, University of Southampton, Southampton, UK","institution_ids":["https://openalex.org/I43439940"]},{"raw_affiliation_string":"Sch. of Electron. & Comput. Sci., Univ. of Southampton, Southampton, UK#TAB#","institution_ids":["https://openalex.org/I43439940"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046941095"],"corresponding_institution_ids":["https://openalex.org/I43439940"],"apc_list":null,"apc_paid":null,"fwci":2.558,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.89470343,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"16","issue":"3","first_page":"319","last_page":"338"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9847000241279602,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9728000164031982,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.7801931500434875},{"id":"https://openalex.org/keywords/fitness-landscape","display_name":"Fitness landscape","score":0.7353832125663757},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6374567151069641},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6094356179237366},{"id":"https://openalex.org/keywords/fitness-function","display_name":"Fitness function","score":0.5778050422668457},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5330590009689331},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5145534873008728},{"id":"https://openalex.org/keywords/fitness-approximation","display_name":"Fitness approximation","score":0.5039162039756775},{"id":"https://openalex.org/keywords/tournament-selection","display_name":"Tournament selection","score":0.42705273628234863},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4238438904285431},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3302355408668518},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28211817145347595},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.27518945932388306}],"concepts":[{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.7801931500434875},{"id":"https://openalex.org/C91852762","wikidata":"https://www.wikidata.org/wiki/Q3307742","display_name":"Fitness landscape","level":3,"score":0.7353832125663757},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6374567151069641},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6094356179237366},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.5778050422668457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5330590009689331},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5145534873008728},{"id":"https://openalex.org/C148392497","wikidata":"https://www.wikidata.org/wiki/Q16250539","display_name":"Fitness approximation","level":4,"score":0.5039162039756775},{"id":"https://openalex.org/C165661538","wikidata":"https://www.wikidata.org/wiki/Q7829327","display_name":"Tournament selection","level":3,"score":0.42705273628234863},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4238438904285431},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3302355408668518},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28211817145347595},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.27518945932388306},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"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/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tevc.2011.2163638","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2011.2163638","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","raw_type":"journal-article"},{"id":"pmh:oai:eprints.gla.ac.uk:152692","is_oa":false,"landing_page_url":"http://eprints.gla.ac.uk/view/author/36581.html>","pdf_url":null,"source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":false,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:eprints.soton.ac.uk:272653","is_oa":false,"landing_page_url":"http://doi.org/10.1109/TEVC.2011.2163638>).","pdf_url":null,"source":{"id":"https://openalex.org/S4306401019","display_name":"ePrints Soton (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W4983232","https://openalex.org/W67367170","https://openalex.org/W1516722946","https://openalex.org/W1529520349","https://openalex.org/W1535529451","https://openalex.org/W1553206939","https://openalex.org/W1562473198","https://openalex.org/W1593799734","https://openalex.org/W1616786285","https://openalex.org/W1650993530","https://openalex.org/W1667614912","https://openalex.org/W1833106254","https://openalex.org/W1833916973","https://openalex.org/W2003005797","https://openalex.org/W2009472032","https://openalex.org/W2011039300","https://openalex.org/W2032431794","https://openalex.org/W2035089769","https://openalex.org/W2039906176","https://openalex.org/W2056828017","https://openalex.org/W2061494390","https://openalex.org/W2063428816","https://openalex.org/W2079275582","https://openalex.org/W2096206883","https://openalex.org/W2098677716","https://openalex.org/W2145255833","https://openalex.org/W2149716043","https://openalex.org/W2152182443","https://openalex.org/W2153607265","https://openalex.org/W2155218845","https://openalex.org/W2165372647","https://openalex.org/W2168379232","https://openalex.org/W3121771796","https://openalex.org/W3123317709","https://openalex.org/W4297799124","https://openalex.org/W6600203084","https://openalex.org/W6630978328","https://openalex.org/W6631629569","https://openalex.org/W6632896710","https://openalex.org/W6637229586","https://openalex.org/W6684615325"],"related_works":["https://openalex.org/W2036107212","https://openalex.org/W2159937791","https://openalex.org/W2164084664","https://openalex.org/W3046481193","https://openalex.org/W2140292604","https://openalex.org/W2146810516","https://openalex.org/W2809695261","https://openalex.org/W4385189452","https://openalex.org/W2753470076","https://openalex.org/W1997104952"],"abstract_inverted_index":{"The":[0,119],"fitness":[1,50,86,134],"landscape":[2,135],"of":[3,21,31,37,45,61,71,90,100],"MAX-3-SAT":[4],"is":[5],"investigated":[6],"for":[7,110],"random":[8],"instances":[9],"above":[10],"the":[11,22,29,34,48,56,59,66,72,75,79,84,91,106,115,133,139],"satisfiability":[12],"phase":[13],"transition.":[14],"This":[15],"paper":[16,120],"includes":[17],"a":[18,26,39,43,63,88,124],"scaling":[19],"analysis":[20],"time":[23],"to":[24,136],"reach":[25],"local":[27,32,40,53,80,111],"optimum,":[28,65],"number":[30],"optima,":[33,74,83],"expected":[35,49,85],"probability":[36,60],"reaching":[38,62],"optimum":[41,96],"as":[42,87,114],"function":[44,89],"its":[46],"fitness,":[47,58],"found":[51],"by":[52],"search":[54,112],"and":[55,68,81,97],"best":[57],"global":[64,73,82],"size":[67,117],"relative":[69],"positions":[70],"mean":[76],"distance":[77,93],"between":[78],"Hamming":[92],"from":[94],"an":[95],"their":[98],"basins":[99],"attraction.":[101],"These":[102],"analyses":[103],"show":[104],"why":[105],"problem":[107],"becomes":[108],"hard":[109],"algorithms":[113],"system":[116],"increases.":[118],"also":[121],"shows":[122],"how":[123],"recently":[125],"proposed":[126],"algorithm":[127],"can":[128],"exploit":[129],"long-range":[130],"correlations":[131],"in":[132],"improve":[137],"on":[138],"state-of-the-art":[140],"heuristic":[141],"algorithms.":[142]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}