{"id":"https://openalex.org/W1574825128","doi":"https://doi.org/10.1109/cec.2005.1554888","title":"Barrier-Based Models of Hard Problems and Crossover","display_name":"Barrier-Based Models of Hard Problems and Crossover","publication_year":2005,"publication_date":"2005-12-13","ids":{"openalex":"https://openalex.org/W1574825128","doi":"https://doi.org/10.1109/cec.2005.1554888","mag":"1574825128"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2005.1554888","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554888","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","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/A5111485912","display_name":"J. Hallam","orcid":null},"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":"J. Hallam","raw_affiliation_strings":["School of Electronics and Computer Science, University of Southampton, Southampton, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electronics and Computer Science, University of Southampton, Southampton, UK","institution_ids":["https://openalex.org/I43439940"]}]},{"author_position":"last","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":false,"raw_author_name":"A. Prugel-Bennett","raw_affiliation_strings":["School of Electronics and Computer Science, University of Southampton, Southampton, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electronics and Computer Science, University of Southampton, Southampton, UK","institution_ids":["https://openalex.org/I43439940"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I43439940"],"apc_list":null,"apc_paid":null,"fwci":0.1962,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.440914,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1661","last_page":"1666"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9972000122070312,"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.9972000122070312,"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/T11269","display_name":"Algorithms and Data Compression","score":0.982699990272522,"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/T11106","display_name":"Data Management and Algorithms","score":0.9825999736785889,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/crossover","display_name":"Crossover","score":0.7865660190582275},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7019884586334229},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6021100282669067},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5669958591461182},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5117732882499695},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4998130798339844},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.48041796684265137},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.46558040380477905},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.43506503105163574},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2941417098045349},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24098685383796692},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2176496386528015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17510521411895752}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7865660190582275},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7019884586334229},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6021100282669067},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5669958591461182},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5117732882499695},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4998130798339844},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.48041796684265137},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.46558040380477905},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.43506503105163574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2941417098045349},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24098685383796692},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2176496386528015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17510521411895752},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2005.1554888","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554888","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1501048105","https://openalex.org/W1982076795","https://openalex.org/W2011039300","https://openalex.org/W2054975983","https://openalex.org/W2095139726","https://openalex.org/W2107951961","https://openalex.org/W2130338985","https://openalex.org/W2131968264","https://openalex.org/W3122583070","https://openalex.org/W6676097241"],"related_works":["https://openalex.org/W2014162767","https://openalex.org/W2115729582","https://openalex.org/W2123829500","https://openalex.org/W2305572622","https://openalex.org/W4283765137","https://openalex.org/W4317496694","https://openalex.org/W3174749984","https://openalex.org/W2809283963","https://openalex.org/W2887485518","https://openalex.org/W1655912143"],"abstract_inverted_index":{"Model":[0],"problems":[1,29,60],"are":[2,19,30,126],"useful":[3],"in":[4,90,95,136,143],"the":[5,79,84,91,107,141],"study":[6,115],"of":[7,57,86,104,129,148],"combinatorial":[8],"optimisation":[9,59,117],"algorithms":[10,118,125],"as":[11,67],"they":[12,45],"allow":[13],"results":[14,94],"to":[15,33,42,47,114,134,157],"be":[16],"calculated":[17],"that":[18,61,131],"difficult":[20,41],"or":[21],"impossible":[22],"with":[23,99],"real":[24,48],"problems.":[25,49],"However,":[26],"these":[27,149],"'toy'":[28],"often":[31],"contrived":[32],"show":[34],"a":[35,52,96,100,120,154],"particular":[36],"feature,":[37],"and":[38,70,88],"it":[39,110],"is":[40,111,132],"know":[43],"how":[44],"compare":[46],"We":[50,139],"present":[51],"framework":[53,74],"for":[54],"creating":[55],"models":[56],"hard":[58,133],"captures":[62],"large":[63],"landscape":[64],"features":[65],"such":[66],"local":[68],"optima":[69],"their":[71],"basins.":[72],"The":[73],"aggregates":[75],"configurations":[76],"by":[77,152],"partitioning":[78],"search":[80],"space":[81],"based":[82],"on":[83],"structure":[85],"basins":[87],"barriers":[89],"landscape.":[92],"This":[93],"model":[97,108,135,158],"problem":[98,109,130],"massively":[101],"reduced":[102],"number":[103],"states.":[105],"For":[106],"readily":[112],"feasible":[113],"simple":[116,155],"using":[119],"Markov":[121],"chain":[122],"analysis.":[123],"Genetic":[124],"one":[127,146],"type":[128],"this":[137],"framework.":[138],"demonstrate":[140],"difficulty":[142],"modelling":[144],"just":[145],"aspect":[147],"algorithms,":[150],"crossover,":[151],"trying":[153],"technique":[156],"it.":[159]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}