{"id":"https://openalex.org/W2038472425","doi":"https://doi.org/10.1145/2463372.2463566","title":"Improved runtime analysis of the simple genetic algorithm","display_name":"Improved runtime analysis of the simple genetic algorithm","publication_year":2013,"publication_date":"2013-07-06","ids":{"openalex":"https://openalex.org/W2038472425","doi":"https://doi.org/10.1145/2463372.2463566","mag":"2038472425"},"language":"en","primary_location":{"id":"doi:10.1145/2463372.2463566","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2463372.2463566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th annual conference on Genetic and 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/A5063001475","display_name":"Pietro S. Oliveto","orcid":"https://orcid.org/0000-0001-8164-6767"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Pietro S. Oliveto","raw_affiliation_strings":["University of Birmingham, Birmingham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Birmingham, Birmingham, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]},{"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, Kgs. Lyngby, Denmark","Technical University of Denmark, Kgs, Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Kgs. Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"Technical University of Denmark, Kgs, 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":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1621","last_page":"1628"},"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.9991999864578247,"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/simple","display_name":"Simple (philosophy)","score":0.6609432101249695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6480855941772461},{"id":"https://openalex.org/keywords/reusability","display_name":"Reusability","score":0.5680363178253174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5488645434379578},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5313416719436646},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5075641870498657},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5026545524597168},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.49243268370628357},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47918617725372314},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4383730888366699},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3737044036388397},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.240790456533432},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12556910514831543},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.11082041263580322},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.07206875085830688}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6609432101249695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6480855941772461},{"id":"https://openalex.org/C137981799","wikidata":"https://www.wikidata.org/wiki/Q1369184","display_name":"Reusability","level":3,"score":0.5680363178253174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5488645434379578},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5313416719436646},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5075641870498657},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5026545524597168},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.49243268370628357},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47918617725372314},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4383730888366699},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3737044036388397},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.240790456533432},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12556910514831543},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.11082041263580322},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.07206875085830688},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2463372.2463566","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2463372.2463566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/ba6f0a9c-47cc-4680-8750-8711970624bd","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/ba6f0a9c-47cc-4680-8750-8711970624bd","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":"Oliveto , P S & Witt , C 2013 , Improved Runtime Analysis of the Simple Genetic Algorithm . in Proceeding of the fifteenth annual conference on Genetic and evolutionary computation . Association for Computing Machinery , pp. 1621-1628 , 2013 Genetic and Evolutionary Computation Conference , Amsterdam , Netherlands , 06/07/2013 . https://doi.org/10.1145/2463372.2463566","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8282950294","display_name":null,"funder_award_id":"EP/H028900/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1522597852","https://openalex.org/W1639032689","https://openalex.org/W1985115934","https://openalex.org/W1987375187","https://openalex.org/W1994258343","https://openalex.org/W1997367770","https://openalex.org/W2004361255","https://openalex.org/W2005317641","https://openalex.org/W2011559870","https://openalex.org/W2012629024","https://openalex.org/W2023709803","https://openalex.org/W2035300004","https://openalex.org/W2080872763","https://openalex.org/W2091824805","https://openalex.org/W2097097696","https://openalex.org/W2100137329","https://openalex.org/W2127379360","https://openalex.org/W2751862591","https://openalex.org/W3023540311","https://openalex.org/W4299432846","https://openalex.org/W7029258064"],"related_works":["https://openalex.org/W4282938614","https://openalex.org/W2906929912","https://openalex.org/W2350686889","https://openalex.org/W1965839502","https://openalex.org/W2099755394","https://openalex.org/W2621742671","https://openalex.org/W2114764029","https://openalex.org/W4245251736","https://openalex.org/W2913352275","https://openalex.org/W1547986167"],"abstract_inverted_index":{"A":[0],"runtime":[1],"analysis":[2,32],"of":[3,37,62,74,102,109,141],"the":[4,10,19,42,72,75,100,103,114,127,139,142],"Simple":[5],"Genetic":[6],"Algorithm":[7],"(SGA)":[8],"for":[9,46,130],"OneMax":[11],"problem":[12],"has":[13],"recently":[14],"been":[15],"presented":[16,136],"proving":[17],"that":[18,77],"algorithm":[20],"requires":[21],"exponential":[22],"time":[23],"with":[24,120],"overwhelming":[25],"probability.":[26],"This":[27],"paper":[28],"presents":[29],"an":[30,56],"improved":[31],"which":[33,54],"overcomes":[34],"some":[35],"limitations":[36],"our":[38],"previous":[39,145],"one.":[40],"Firstly,":[41],"new":[43,143],"result":[44],"holds":[45],"population":[47,76],"sizes":[48],"up":[49,58],"to":[50,59,70,137],"mu":[51],"=":[52],"n1/4-epsilon":[53],"is":[55,95],"improvement":[57,98],"a":[60,68,81,89,96],"power":[61],"2":[63],"larger.":[64],"Secondly,":[65],"we":[66,92,112],"present":[67],"technique":[69],"bound":[71,82],"diversity":[73],"does":[78],"not":[79],"require":[80],"on":[83],"its":[84],"bandwidth.":[85],"Apart":[86],"from":[87],"allowing":[88],"stronger":[90],"result,":[91],"believe":[93],"this":[94],"major":[97],"towards":[99],"reusability":[101],"techniques":[104],"in":[105],"future":[106],"systematic":[107],"analyses":[108],"GAs.":[110],"Finally,":[111],"consider":[113],"more":[115],"natural":[116],"SGA":[117],"using":[118],"selection":[119],"replacement":[121,125],"rather":[122],"than":[123],"without":[124],"although":[126],"results":[128],"hold":[129],"both":[131],"algorithmic":[132],"versions.":[133],"Experiments":[134],"are":[135],"explore":[138],"limits":[140],"and":[144],"mathematical":[146],"techniques.":[147]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}