{"id":"https://openalex.org/W1992339380","doi":"https://doi.org/10.1162/106365602317301781","title":"Network Random Keys\u2014A Tree Representation Scheme for Genetic and Evolutionary Algorithms","display_name":"Network Random Keys\u2014A Tree Representation Scheme for Genetic and Evolutionary Algorithms","publication_year":2002,"publication_date":"2002-03-01","ids":{"openalex":"https://openalex.org/W1992339380","doi":"https://doi.org/10.1162/106365602317301781","mag":"1992339380","pmid":"https://pubmed.ncbi.nlm.nih.gov/11911783"},"language":"en","primary_location":{"id":"doi:10.1162/106365602317301781","is_oa":false,"landing_page_url":"https://doi.org/10.1162/106365602317301781","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5035443886","display_name":"Franz Rothlauf","orcid":"https://orcid.org/0000-0003-3376-427X"},"institutions":[{"id":"https://openalex.org/I54009628","display_name":"University of Bayreuth","ror":"https://ror.org/0234wmv40","country_code":"DE","type":"education","lineage":["https://openalex.org/I54009628"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Franz Rothlauf","raw_affiliation_strings":["Department of Information Systems, University of Bayreuth, University atsstr. 30, D-95440 Bayreuth, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Systems, University of Bayreuth, University atsstr. 30, D-95440 Bayreuth, Germany","institution_ids":["https://openalex.org/I54009628"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110057218","display_name":"David E. Goldberg","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David E. Goldberg","raw_affiliation_strings":["Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, 117 Transportation Building, 104 S. Mathews Ave. Urbana, IL 61801, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, 117 Transportation Building, 104 S. Mathews Ave. Urbana, IL 61801, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039252960","display_name":"Armin Heinzl","orcid":"https://orcid.org/0000-0001-9886-9596"},"institutions":[{"id":"https://openalex.org/I54009628","display_name":"University of Bayreuth","ror":"https://ror.org/0234wmv40","country_code":"DE","type":"education","lineage":["https://openalex.org/I54009628"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Armin Heinzl","raw_affiliation_strings":["Department of Information Systems, University of Bayreuth, University atsstr. 30, D-95440 Bayreuth, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Systems, University of Bayreuth, University atsstr. 30, D-95440 Bayreuth, Germany","institution_ids":["https://openalex.org/I54009628"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":17.8636,"has_fulltext":false,"cited_by_count":158,"citation_normalized_percentile":{"value":0.99418182,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"10","issue":"1","first_page":"75","last_page":"97"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9697999954223633,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9616000056266785,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7168667316436768},{"id":"https://openalex.org/keywords/tree-network","display_name":"Tree network","score":0.5770736932754517},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5556890964508057},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5509924292564392},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5488102436065674},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5322223901748657},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.4935671091079712},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.47551852464675903},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47042179107666016},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.46785834431648254},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.42503973841667175},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.4161593019962311},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38861486315727234},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3825089931488037},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2476203739643097},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.16700008511543274},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.15306058526039124},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07937544584274292}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7168667316436768},{"id":"https://openalex.org/C2781010653","wikidata":"https://www.wikidata.org/wiki/Q12056602","display_name":"Tree network","level":3,"score":0.5770736932754517},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5556890964508057},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5509924292564392},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5488102436065674},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5322223901748657},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.4935671091079712},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.47551852464675903},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47042179107666016},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.46785834431648254},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.42503973841667175},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.4161593019962311},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38861486315727234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3825089931488037},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2476203739643097},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.16700008511543274},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.15306058526039124},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07937544584274292},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008957","descriptor_name":"Models, Genetic","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008957","descriptor_name":"Models, Genetic","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008957","descriptor_name":"Models, Genetic","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D011897","descriptor_name":"Random Allocation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D011897","descriptor_name":"Random Allocation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D011897","descriptor_name":"Random Allocation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D012107","descriptor_name":"Research Design","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D012107","descriptor_name":"Research Design","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D012107","descriptor_name":"Research Design","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D019143","descriptor_name":"Evolution, Molecular","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D019143","descriptor_name":"Evolution, Molecular","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D019143","descriptor_name":"Evolution, Molecular","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true}],"locations_count":3,"locations":[{"id":"doi:10.1162/106365602317301781","is_oa":false,"landing_page_url":"https://doi.org/10.1162/106365602317301781","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:11911783","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/11911783","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.6884","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.6884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp-illigal.ge.uiuc.edu/pub/papers/Publications/2002/EC2002-rothlauf.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W47390315","https://openalex.org/W86594232","https://openalex.org/W88420641","https://openalex.org/W98056105","https://openalex.org/W107178210","https://openalex.org/W325630429","https://openalex.org/W1482076823","https://openalex.org/W1500470339","https://openalex.org/W1507599800","https://openalex.org/W1512136126","https://openalex.org/W1526869991","https://openalex.org/W1565732740","https://openalex.org/W1572982068","https://openalex.org/W1575146608","https://openalex.org/W1581807583","https://openalex.org/W1584377038","https://openalex.org/W1590794797","https://openalex.org/W1599719704","https://openalex.org/W1601249642","https://openalex.org/W1639032689","https://openalex.org/W1838841162","https://openalex.org/W1890607646","https://openalex.org/W1953727931","https://openalex.org/W2017651866","https://openalex.org/W2027945080","https://openalex.org/W2037703285","https://openalex.org/W2056769911","https://openalex.org/W2066670127","https://openalex.org/W2142146559","https://openalex.org/W2147620981","https://openalex.org/W2151924821","https://openalex.org/W2168079536","https://openalex.org/W2278052651","https://openalex.org/W3165831389"],"related_works":["https://openalex.org/W1606499289","https://openalex.org/W1985939653","https://openalex.org/W2741252017","https://openalex.org/W2911578165","https://openalex.org/W2626282817","https://openalex.org/W2143442844","https://openalex.org/W4297691931","https://openalex.org/W2279685447","https://openalex.org/W2775257415","https://openalex.org/W4298054488"],"abstract_inverted_index":{"When":[0,57],"using":[1,44,120,184,205,220],"genetic":[2,117,203],"and":[3,43,46,101,129,140,168,201],"evolutionary":[4],"algorithms":[5,204],"for":[6,14,22,32,125,166,196,234],"network":[7,121,137,178,206,231],"design,":[8],"choosing":[9],"a":[10,70,115,130],"good":[11],"representation":[12,30,236],"scheme":[13],"the":[15,18,27,35,59,63,78,81,94,105,112,126,136,141,148,155,197,221,235],"construction":[16],"of":[17,26,80,96,107,114,150,199,237],"genotype":[19],"is":[20,34,73],"important":[21],"algorithm":[23,118],"performance.":[24],"One":[25],"most":[28],"common":[29],"schemes":[31],"networks":[33],"characteristic":[36,142,156,185,222],"vector":[37,143,157],"representation.":[38],"However,":[39],"with":[40,161,177],"encoding":[41,106,144,198],"trees,":[42,200],"crossover":[45],"mutation,":[47,152],"invalid":[48,64],"individuals":[49,65],"occur":[50],"that":[51,66,83,146,190,202],"are":[52,209],"either":[53],"under-":[54],"or":[55,61],"over-specified.":[56],"constructing":[58],"offspring":[60],"repairing":[62],"do":[67],"not":[68],"represent":[69],"tree,":[71],"it":[72],"impossible":[74],"to":[75,104,211,229],"distinguish":[76],"between":[77,135],"importance":[79],"links":[82],"should":[84,225],"be":[85,90,194,227],"used.":[86],"These":[87],"problems":[88,103,215],"can":[89,193],"overcome":[91],"by":[92],"transferring":[93],"concept":[95],"random":[97,122,138,179,191,207,232],"keys":[98,123,139,180,192,208,233],"from":[99],"scheduling":[100],"ordering":[102],"trees.":[108,238],"This":[109,187],"paper":[110,188],"investigates":[111],"performance":[113],"simple":[116],"(SGA)":[119],"(NetKeys)":[124],"one-max":[127],"tree":[128,214],"real-world":[131],"problem.":[132],"The":[133],"comparison":[134],"shows":[145,189],"despite":[147],"effects":[149],"stealth":[151],"which":[153],"favors":[154],"representation,":[158],"selectorecombinative":[159],"SGAs":[160,176,183],"NetKeys":[162],"have":[163],"some":[164],"advantages":[165],"small":[167],"easy":[169],"optimization":[170],"problems.":[171],"With":[172],"more":[173],"complex":[174,213],"problems,":[175],"significantly":[181],"outperform":[182],"vectors.":[186],"used":[195],"able":[210],"solve":[212],"much":[216],"faster":[217],"than":[218],"when":[219],"vector.":[223],"Users":[224],"therefore":[226],"encouraged":[228],"use":[230]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}