{"id":"https://openalex.org/W2955800573","doi":"https://doi.org/10.1145/3321707.3321848","title":"Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs","display_name":"Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs","publication_year":2019,"publication_date":"2019-07-03","ids":{"openalex":"https://openalex.org/W2955800573","doi":"https://doi.org/10.1145/3321707.3321848","mag":"2955800573"},"language":"en","primary_location":{"id":"doi:10.1145/3321707.3321848","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3321707.3321848","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbit.dtu.dk/en/publications/7cf8c3ed-80cd-4b0a-8921-1f2b3f044c76","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004695687","display_name":"Andrew M. Sutton","orcid":"https://orcid.org/0000-0003-1295-6715"},"institutions":[{"id":"https://openalex.org/I4210115145","display_name":"University of Minnesota, Duluth","ror":"https://ror.org/01hy4qx27","country_code":"US","type":"education","lineage":["https://openalex.org/I4210115145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew M. Sutton","raw_affiliation_strings":["University of Minnesota Duluth"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Minnesota Duluth","institution_ids":["https://openalex.org/I4210115145"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038689623","display_name":"Carsten Witt","orcid":"https://orcid.org/0000-0002-6105-7700"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Carsten Witt","raw_affiliation_strings":["Technical University of Denmark, Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1515","last_page":"1522"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9998000264167786,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9998000264167786,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"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.9988999962806702,"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/crossover","display_name":"Crossover","score":0.9158468246459961},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5879127979278564},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5385201573371887},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5287192463874817},{"id":"https://openalex.org/keywords/decoupling","display_name":"Decoupling (probability)","score":0.515235960483551},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47895509004592896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.475818932056427},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46605122089385986},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.42106354236602783},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40692320466041565},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3948379158973694},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13411489129066467}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9158468246459961},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5879127979278564},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5385201573371887},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5287192463874817},{"id":"https://openalex.org/C205606062","wikidata":"https://www.wikidata.org/wiki/Q5249645","display_name":"Decoupling (probability)","level":2,"score":0.515235960483551},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47895509004592896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.475818932056427},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46605122089385986},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.42106354236602783},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40692320466041565},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3948379158973694},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13411489129066467},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C133731056","wikidata":"https://www.wikidata.org/wiki/Q4917288","display_name":"Control engineering","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3321707.3321848","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3321707.3321848","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/7cf8c3ed-80cd-4b0a-8921-1f2b3f044c76","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/7cf8c3ed-80cd-4b0a-8921-1f2b3f044c76","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sutton , A M & Witt , C 2019 , Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs . in Proceedings of the 2019 Genetic and Evolutionary Computation Conference . Association for Computing Machinery , GECCO 2019 - Proceedings of the 2019 Genetic and Evolutionary Computation Conference , pp. 1515-1522 , 2019 Genetic and Evolutionary Computation Conference , Prague , Czech Republic , 13/07/2019 . https://doi.org/10.1145/3321707.3321848","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/c1e0de95-eab8-4718-8da9-46ce2a37e45f","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/c1e0de95-eab8-4718-8da9-46ce2a37e45f","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sutton , A M & Witt , C 2020 , ' Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs ' , Algorithmica . https://doi.org/10.1007/s00453-020-00776-6","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/7cf8c3ed-80cd-4b0a-8921-1f2b3f044c76","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/7cf8c3ed-80cd-4b0a-8921-1f2b3f044c76","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sutton , A M & Witt , C 2019 , Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs . in Proceedings of the 2019 Genetic and Evolutionary Computation Conference . Association for Computing Machinery , GECCO 2019 - Proceedings of the 2019 Genetic and Evolutionary Computation Conference , pp. 1515-1522 , 2019 Genetic and Evolutionary Computation Conference , Prague , Czech Republic , 13/07/2019 . https://doi.org/10.1145/3321707.3321848","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1596384364","https://openalex.org/W1980841486","https://openalex.org/W1981241191","https://openalex.org/W2006072452","https://openalex.org/W2010449655","https://openalex.org/W2011559870","https://openalex.org/W2015353056","https://openalex.org/W2017801775","https://openalex.org/W2023709803","https://openalex.org/W2049816819","https://openalex.org/W2060951702","https://openalex.org/W2061751517","https://openalex.org/W2064545488","https://openalex.org/W2074343258","https://openalex.org/W2082931571","https://openalex.org/W2091824805","https://openalex.org/W2127379360","https://openalex.org/W2145818164","https://openalex.org/W2160241726","https://openalex.org/W2161238506","https://openalex.org/W2161244294","https://openalex.org/W2187785713","https://openalex.org/W2501406586","https://openalex.org/W2745272116","https://openalex.org/W2885751302","https://openalex.org/W2887810854","https://openalex.org/W3100597221","https://openalex.org/W3122779104"],"related_works":["https://openalex.org/W2347477706","https://openalex.org/W1943663474","https://openalex.org/W4299389082","https://openalex.org/W2306830238","https://openalex.org/W2110294633","https://openalex.org/W1606499289","https://openalex.org/W1985939653","https://openalex.org/W2726551571","https://openalex.org/W2911578165","https://openalex.org/W2626282817"],"abstract_inverted_index":{"The":[0],"runtime":[1],"analysis":[2],"of":[3,20,40,49,58,114,137],"evolutionary":[4,86],"algorithms":[5,60],"using":[6,61,128],"crossover":[7,21,63],"as":[8],"search":[9,66],"operator":[10],"has":[11],"recently":[12],"produced":[13],"remarkable":[14],"results":[15,30],"indicating":[16],"benefits":[17],"and":[18,22,52,78,93],"drawbacks":[19],"illustrating":[23],"its":[24],"working":[25],"principles.":[26],"Virtually":[27],"all":[28],"these":[29,148],"are":[31,103,165],"restricted":[32],"to":[33,111],"upper":[34],"bounds":[35,51,54,155],"on":[36,64,156,160],"the":[37,41,55,65,112,117,121,138,157,161],"running":[38],"time":[39,57,159],"crossover-based":[42,85,126],"algorithms.":[43],"This":[44],"work":[45],"addresses":[46],"this":[47],"lack":[48],"lower":[50,154],"rigorously":[53],"optimization":[56,158],"simple":[59,83],"uniform":[62],"space":[67],"{0,":[68],"1}n":[69],"from":[70],"below":[71],"via":[72],"two":[73],"novel":[74,135],"techniques":[75],"called":[76],"decoupling":[77],"family":[79,139,150],"graphs.":[80],"First,":[81],"a":[82,125,134],"steady-state":[84],"algorithm":[87,127],"without":[88],"selection":[89,130],"pressure":[90],"is":[91,131],"analyzed":[92,132],"shown":[94],"that":[95],"after":[96],"O(\u00b5":[97],"log":[98],"\u00b5)":[99],"generations,":[100],"bit":[101],"positions":[102],"sampled":[104],"almost":[105,152],"independently":[106],"with":[107],"marginal":[108],"probabilities":[109],"corresponding":[110,118],"fraction":[113],"one-bits":[115],"at":[116],"position":[119],"in":[120],"initial":[122],"population.":[123],"Afterwards,":[124],"tournament":[129],"by":[133],"generalization":[136],"tree":[140],"technique":[141],"originally":[142],"introduced":[143],"for":[144],"mutation-only":[145],"EAs.":[146],"Using":[147],"so-called":[149],"graphs,":[151],"tight":[153],"OneMax":[162],"benchmark":[163],"function":[164],"shown.":[166]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}