{"id":"https://openalex.org/W2027881843","doi":"https://doi.org/10.1145/2460239.2460245","title":"When do evolutionary algorithms optimize separable functions in parallel?","display_name":"When do evolutionary algorithms optimize separable functions in parallel?","publication_year":2013,"publication_date":"2013-01-16","ids":{"openalex":"https://openalex.org/W2027881843","doi":"https://doi.org/10.1145/2460239.2460245","mag":"2027881843"},"language":"en","primary_location":{"id":"doi:10.1145/2460239.2460245","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2460239.2460245","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twelfth workshop on Foundations of genetic algorithms XII","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/A5105520300","display_name":"Benjamin Doerr","orcid":"https://orcid.org/0000-0001-5283-4208"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Benjamin Doerr","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018789989","display_name":"Dirk Sudholt","orcid":"https://orcid.org/0000-0001-6020-1646"},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dirk Sudholt","raw_affiliation_strings":["University of Sheffield, Sheffield, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Sheffield, Sheffield, United Kingdom","institution_ids":["https://openalex.org/I91136226"]}]},{"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","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"]},{"raw_affiliation_string":"Technical University of Denmark,,,Lyngby,,Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"51","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","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/T11975","display_name":"Evolutionary Algorithms and Applications","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.9950000047683716,"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.696643590927124},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.6043040752410889},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5081663131713867},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4527861475944519},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4342253506183624},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41004762053489685},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3426705598831177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21963730454444885},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18994569778442383}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.696643590927124},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.6043040752410889},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5081663131713867},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4527861475944519},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4342253506183624},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41004762053489685},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3426705598831177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21963730454444885},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18994569778442383},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2460239.2460245","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2460239.2460245","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twelfth workshop on Foundations of genetic algorithms XII","raw_type":"proceedings-article"},{"id":"pmh:oai:escidoc.org:escidoc:1922427","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0015-3C43-9","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.atira.dk:publications/7c4dcd18-6de3-49ce-a6fb-88b040b6a05c","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/7c4dcd18-6de3-49ce-a6fb-88b040b6a05c","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Doerr , B , Sudholt , D & Witt , C 2013 , When do evolutionary algorithms optimize separable functions in parallel? in Proceedings of the 12th ACM Workshop on Foundations of Genetic Algorithms (FOGA 2013) . Association for Computing Machinery , pp. 51-64 , 12th ACM Conference on Foundations of Genetic Algorithms XII (FOGA 2013) , Adelaide , Australia , 16/01/2013 . https://doi.org/10.1145/2460239.2460245","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1488747864","https://openalex.org/W1555689267","https://openalex.org/W1593495653","https://openalex.org/W1605768620","https://openalex.org/W1639032689","https://openalex.org/W1652824837","https://openalex.org/W1749374052","https://openalex.org/W1973749901","https://openalex.org/W1980771067","https://openalex.org/W1996375957","https://openalex.org/W2002970881","https://openalex.org/W2041706554","https://openalex.org/W2042521440","https://openalex.org/W2075706745","https://openalex.org/W2080872763","https://openalex.org/W2084149434","https://openalex.org/W2094453630","https://openalex.org/W2096590200","https://openalex.org/W2096795740","https://openalex.org/W2102044362","https://openalex.org/W2107951961","https://openalex.org/W2109472859","https://openalex.org/W2165220807","https://openalex.org/W2293414222","https://openalex.org/W2295428206","https://openalex.org/W2899702797","https://openalex.org/W2913346160","https://openalex.org/W3023540311","https://openalex.org/W3100597221","https://openalex.org/W6636209375"],"related_works":["https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W2391924736","https://openalex.org/W3133779647","https://openalex.org/W1560122427","https://openalex.org/W3041827036","https://openalex.org/W1993493607","https://openalex.org/W2021957875","https://openalex.org/W2802808995","https://openalex.org/W2787833928"],"abstract_inverted_index":{"Separable":[0],"functions":[1],"are":[2,67],"composed":[3],"of":[4,12,32],"subfunctions":[5,15,33,47],"that":[6,40,51],"depend":[7],"on":[8,45],"mutually":[9],"disjoint":[10],"sets":[11],"bits.":[13],"These":[14],"can":[16],"be":[17,35],"optimized":[18,68],"independently,":[19],"however":[20],"in":[21,48],"black-box":[22],"optimization":[23],"this":[24],"direct":[25],"approach":[26],"is":[27,39],"infeasible":[28],"as":[29],"the":[30,64],"composition":[31],"may":[34],"unknown.":[36],"Common":[37],"belief":[38],"evolutionary":[41],"algorithms":[42],"make":[43],"progress":[44],"all":[46],"parallel,":[49],"so":[50],"optimizing":[52,63],"a":[53],"separable":[54],"function":[55],"does":[56],"not":[57,59],"take":[58],"much":[60],"longer":[61],"than":[62],"hardest":[65],"subfunction---subfunctions":[66],"\"in":[69],"parallel.\"":[70]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}