{"id":"https://openalex.org/W2804953719","doi":"https://doi.org/10.1145/3205455.3205576","title":"Medium step sizes are harmful for the compact genetic algorithm","display_name":"Medium step sizes are harmful for the compact genetic algorithm","publication_year":2018,"publication_date":"2018-07-02","ids":{"openalex":"https://openalex.org/W2804953719","doi":"https://doi.org/10.1145/3205455.3205576","mag":"2804953719"},"language":"en","primary_location":{"id":"doi:10.1145/3205455.3205576","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3205455.3205576","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/20b2fefa-4edd-442e-b755-0413c1fbb6e7","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084778631","display_name":"Johannes Lengler","orcid":"https://orcid.org/0000-0003-0004-7629"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Johannes Lengler","raw_affiliation_strings":["ETH Z\u00fcrich, Z\u00fcrich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"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":["DTU Compute Technical University of Denmark, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DTU Compute Technical University of Denmark, 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":33,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1499","last_page":"1506"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9983999729156494,"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.9958999752998352,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.6995629668235779},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.59619140625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.522215723991394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4626774191856384},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4340231716632843},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4298378825187683},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3776821196079254},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35462862253189087},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.22343116998672485}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6995629668235779},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.59619140625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.522215723991394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4626774191856384},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4340231716632843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4298378825187683},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3776821196079254},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35462862253189087},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.22343116998672485}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3205455.3205576","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3205455.3205576","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:eprints.whiterose.ac.uk:130706","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Proceedings Paper"},{"id":"pmh:oai:pure.atira.dk:publications/20b2fefa-4edd-442e-b755-0413c1fbb6e7","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/20b2fefa-4edd-442e-b755-0413c1fbb6e7","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":"Lengler , J , Sudholt , D & Witt , C 2018 , Medium step sizes are harmful for the compact genetic algorithm . in 2018 Proceedings of the Genetic and Evolutionary Computation Conference . Association for Computing Machinery , pp. 1499-1506 . https://doi.org/10.1145/3205455.3205576","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/20b2fefa-4edd-442e-b755-0413c1fbb6e7","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/20b2fefa-4edd-442e-b755-0413c1fbb6e7","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":"Lengler , J , Sudholt , D & Witt , C 2018 , Medium step sizes are harmful for the compact genetic algorithm . in 2018 Proceedings of the Genetic and Evolutionary Computation Conference . Association for Computing Machinery , pp. 1499-1506 . https://doi.org/10.1145/3205455.3205576","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7599999904632568}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1570731788","https://openalex.org/W1933565355","https://openalex.org/W1979634879","https://openalex.org/W1989274820","https://openalex.org/W1990799344","https://openalex.org/W2081568812","https://openalex.org/W2148379945","https://openalex.org/W2296129337","https://openalex.org/W2501406586","https://openalex.org/W2605136245","https://openalex.org/W2724311120","https://openalex.org/W2727744916","https://openalex.org/W2751862591","https://openalex.org/W2899702797","https://openalex.org/W3099820049","https://openalex.org/W3102042098","https://openalex.org/W4301441647","https://openalex.org/W7029258064"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2943623134","https://openalex.org/W2494523064","https://openalex.org/W2215759665","https://openalex.org/W2030292806","https://openalex.org/W2960358116","https://openalex.org/W2938171715","https://openalex.org/W4287727129","https://openalex.org/W3041172967","https://openalex.org/W2749065928"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,6,19,35,56,73,88],"intricate":[3],"dynamics":[4],"of":[5],"Compact":[7],"Genetic":[8],"Algorithm":[9],"(cGA)":[10],"on":[11,18],"OneMax,":[12],"and":[13,43],"how":[14,25],"its":[15],"performance":[16,75],"depends":[17],"step":[20,57],"size":[21,58],"1/K,":[22],"that":[23,41],"determines":[24],"quickly":[26],"decisions":[27,67,102],"about":[28],"promising":[29],"bit":[30],"values":[31],"are":[32,103],"fixed":[33,104],"in":[34,49,76,87],"probabilistic":[36],"model.":[37],"It":[38],"is":[39,59],"known":[40],"cGA":[42],"UMDA,":[44],"a":[45,77],"related":[46],"algorithm,":[47],"run":[48],"expected":[50],"time":[51],"O(n":[52],"log":[53],"n)":[54,86],"when":[55],"just":[60],"small":[61],"enough":[62],"[EQUATION]":[63],"to":[64,82],"avoid":[65],"wrong":[66,101],"being":[68],"fixed.":[69],"UMDA":[70],"also":[71],"shows":[72],"same":[74],"very":[78,97],"different":[79,98],"regime":[80],"(equivalent":[81],"K":[83],"=":[84],"\u0398(log":[85],"cGA)":[89],"with":[90],"much":[91],"larger":[92],"steps":[93],"sizes,":[94],"but":[95,106],"for":[96],"reasons:":[99],"many":[100],"initially,":[105],"then":[107],"reverted":[108],"efficiently.":[109]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}