{"id":"https://openalex.org/W130397803","doi":null,"title":"Computational complexity and the genetic algorithm","display_name":"Computational complexity and the genetic algorithm","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W130397803","mag":"130397803"},"language":"en","primary_location":{"id":"mag:130397803","doi":null,"is_oa":false,"landing_page_url":"http://portal.acm.org/citation.cfm?id=933869","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5088533669","display_name":"Bart Rylander","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bart Rylander","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5061637086","display_name":"James A. Foster","orcid":"https://orcid.org/0000-0002-6770-6521","observed_orcids":["https://orcid.org/0000-0002-6770-6521"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"James A. Foster","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-6770-6521","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0325,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.79696371,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.5092999935150146,"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.5092999935150146,"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.4657999873161316,"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/T12029","display_name":"DNA and Biological Computing","score":0.007600000128149986,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.9520000219345093},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.9649999737739563},{"id":"https://openalex.org/keywords/quantum-computing","display_name":"quantum computing","score":0.6959999799728394},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"evolutionary computation","score":0.7440000176429749},{"id":"https://openalex.org/keywords/complexity-classes","display_name":"complexity classes","score":0.6620000004768372},{"id":"https://openalex.org/keywords/function-optimization","display_name":"function optimization","score":0.7730000019073486},{"id":"https://openalex.org/keywords/search-efficiency","display_name":"search efficiency","score":0.45899999141693115}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6578675508499146},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6360416412353516},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.614602267742157},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5497869849205017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5003376007080078},{"id":"https://openalex.org/C5536111","wikidata":"https://www.wikidata.org/wiki/Q5193250","display_name":"Cultural algorithm","level":4,"score":0.4928310215473175},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.4813438355922699},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33432304859161377},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32595956325531006},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31573373079299927},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.28254270553588867},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.276267409324646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2023860514163971},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:130397803","doi":null,"is_oa":false,"landing_page_url":"http://portal.acm.org/citation.cfm?id=933869","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W93211624","https://openalex.org/W102404136","https://openalex.org/W106723995","https://openalex.org/W158211058","https://openalex.org/W1485560021","https://openalex.org/W1489417573","https://openalex.org/W1497256448","https://openalex.org/W1499561572","https://openalex.org/W1502596244","https://openalex.org/W1533419692","https://openalex.org/W1536712125","https://openalex.org/W1557784766","https://openalex.org/W1568834902","https://openalex.org/W1574823768","https://openalex.org/W1587100796","https://openalex.org/W1596568617","https://openalex.org/W1902082498","https://openalex.org/W1962752774","https://openalex.org/W1979951029","https://openalex.org/W1991676736","https://openalex.org/W2008438091","https://openalex.org/W2040792108","https://openalex.org/W2071356525","https://openalex.org/W2084652510","https://openalex.org/W2143935213","https://openalex.org/W2148132004","https://openalex.org/W2526208276","https://openalex.org/W2904250082","https://openalex.org/W3023540311"],"related_works":["https://openalex.org/W7098087125","https://openalex.org/W7095966816","https://openalex.org/W4396842882","https://openalex.org/W2181166693","https://openalex.org/W2899960936","https://openalex.org/W2053987102","https://openalex.org/W7119280105","https://openalex.org/W7097434337","https://openalex.org/W7099498070","https://openalex.org/W7097194588"],"abstract_inverted_index":{"A":[0],"genetic":[1,85,132,192,231,250,260],"algorithm":[2,86,133,261],"is":[3,12,21,26,38,76,82,87,103,134,208,220,226,254,265,286,301],"a":[4,47,89,135,143,181,198,227,239,246,270],"biologically":[5],"inspired":[6],"method":[7,137,163,240,253,271],"for":[8,116,183,190,241,249,272,282,298],"function":[9],"optimization":[10],"that":[11,138,312],"loosely":[13],"based":[14],"on":[15],"the":[16,30,35,65,80,84,106,121,125,129,131,185,191,202,212,243,277,289,295],"theory":[17],"of":[18,29,43,49,57,67,91,95,120,146,169,187,204,214,245,279,291,304,318],"evolution.":[19,92],"It":[20],"typically":[22],"used":[23,255],"when":[24,34],"there":[25,177,225],"little":[27,59],"knowledge":[28,102],"solution":[31],"space":[32,37],"or":[33],"search":[36,136],"prohibitively":[39],"large.":[40],"Despite":[41],"years":[42],"successful":[44],"application":[45],"to":[46,55,63,72,124,156,222,256],"variety":[48],"problems":[50,68,118,188,205,280],"ranging":[51],"from":[52,105],"superstructure":[53],"design":[54],"simulation":[56,90,97],"bacteria,":[58],"has":[60],"been":[61,314],"done":[62],"characterize":[64],"complexity":[66,186,213,244,262,278,296],"as":[69,100,110,142,267,269,309,316],"they":[70],"relate":[71],"this":[73,96,162,217,319],"method.":[74],"\r\nComplexity":[75],"critical":[77],"however.":[78],"Though":[79],"metaphor":[81],"seductive,":[83],"only":[88],"The":[93,252],"accuracy":[94],"changes":[98],"daily":[99],"more":[101],"gained":[104],"biological":[107,126],"communities":[108],"and":[109,148,206],"computer":[111],"researchers":[112],"find":[113],"better":[114],"methods":[115],"solving":[117],"regardless":[119],"strict":[122],"adherence":[123],"inspiration.":[127],"In":[128,216,275],"end,":[130],"must":[139,178,196],"be":[140,180],"implemented":[141],"program":[144],"consisting":[145],"loops":[147],"if":[149],"statements.":[150],"Given":[151],"this,":[152,176],"it":[153,219],"seems":[154],"reasonable":[155],"evaluate":[157,223],"whether":[158,224],"programs":[159],"developed":[160,315],"using":[161,230],"provide":[164],"any":[165],"advantage":[166],"in":[167,229],"terms":[168],"efficiency":[170],"over":[171],"other":[172],"methods.":[173],"To":[174],"do":[175],"first":[179],"way":[182,218],"evaluating":[184,242],"specifically":[189,248,281],"algorithm.":[193],"This":[194],"technique":[195],"enable":[197],"direct":[199],"comparison":[200],"between":[201],"GA-complexity":[203],"what":[207],"already":[209],"known":[210],"about":[211],"problems.":[215],"possible":[221],"\u201cgain\u201d":[228],"algorithms":[232],"beyond":[233],"programmer":[234],"ergonomics.":[235],"\r\nThis":[236],"dissertation":[237],"describes":[238],"problem":[247],"algorithms.":[251],"define":[257],"two":[258],"specific":[259],"classes.":[263],"GA-hardness":[264],"defined":[266],"well":[268],"GA":[273],"reduction.":[274],"addition,":[276],"Genetic":[283],"Programming":[284],"(GP)":[285],"analyzed.":[287],"Finally,":[288],"impact":[290],"quantum":[292],"computers":[293],"upon":[294],"classes":[297],"evolutionary":[299],"computation":[300],"examined.":[302],"All":[303],"these":[305],"areas":[306],"are":[307],"presented":[308],"peer-reviewed":[310],"publications":[311],"have":[313],"part":[317],"research.":[320]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}
