{"id":"https://openalex.org/W2158280690","doi":"https://doi.org/10.1145/1068009.1068108","title":"The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem","display_name":"The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem","publication_year":2005,"publication_date":"2005-06-25","ids":{"openalex":"https://openalex.org/W2158280690","doi":"https://doi.org/10.1145/1068009.1068108","mag":"2158280690"},"language":"en","primary_location":{"id":"doi:10.1145/1068009.1068108","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068108","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","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/A5073112856","display_name":"Bryant A. Julstrom","orcid":null},"institutions":[{"id":"https://openalex.org/I173963315","display_name":"St. Cloud State University","ror":"https://ror.org/016czhx14","country_code":"US","type":"education","lineage":["https://openalex.org/I173963315","https://openalex.org/I91221267"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bryant A. Julstrom","raw_affiliation_strings":["St. Cloud State University, St. Cloud, MN"],"affiliations":[{"raw_affiliation_string":"St. Cloud State University, St. Cloud, MN","institution_ids":["https://openalex.org/I173963315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073112856"],"corresponding_institution_ids":["https://openalex.org/I173963315"],"apc_list":null,"apc_paid":null,"fwci":2.1938,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.8957183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"585","last_page":"590"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9925000071525574,"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.9599000215530396,"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/spanning-tree","display_name":"Spanning tree","score":0.8680189847946167},{"id":"https://openalex.org/keywords/bijection-injection-and-surjection","display_name":"Bijection, injection and surjection","score":0.8032636642456055},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6487119793891907},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6352816820144653},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6310067176818848},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5199272036552429},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4846065938472748},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.47115767002105713},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4708021879196167},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.45975565910339355},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.42341217398643494},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41334372758865356},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39621487259864807},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3307383954524994}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8680189847946167},{"id":"https://openalex.org/C48659774","wikidata":"https://www.wikidata.org/wiki/Q4907197","display_name":"Bijection, injection and surjection","level":3,"score":0.8032636642456055},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6487119793891907},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6352816820144653},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6310067176818848},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5199272036552429},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4846065938472748},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.47115767002105713},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4708021879196167},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.45975565910339355},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.42341217398643494},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41334372758865356},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39621487259864807},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3307383954524994},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1068009.1068108","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068108","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land","score":0.5299999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W13055504","https://openalex.org/W1500089245","https://openalex.org/W1520068163","https://openalex.org/W1529274084","https://openalex.org/W1574390288","https://openalex.org/W1986022261","https://openalex.org/W1992339380","https://openalex.org/W2016218947","https://openalex.org/W2026761866","https://openalex.org/W2047517090","https://openalex.org/W2049967755","https://openalex.org/W2054148890","https://openalex.org/W2142146559","https://openalex.org/W2151924821","https://openalex.org/W2553054816","https://openalex.org/W2561675875","https://openalex.org/W2616697817","https://openalex.org/W2753176400","https://openalex.org/W3004042307","https://openalex.org/W3138832177","https://openalex.org/W4206085891","https://openalex.org/W4249958171","https://openalex.org/W6738002306"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W2387385213","https://openalex.org/W3016811403","https://openalex.org/W88291963","https://openalex.org/W4380840098","https://openalex.org/W2418231958","https://openalex.org/W2014991506","https://openalex.org/W2518240130","https://openalex.org/W2059360098","https://openalex.org/W4308416203"],"abstract_inverted_index":{"Among":[0],"the":[1,25,33,64,89,106,121,140],"many":[2],"codings":[3],"of":[4,18,29,88,120],"spanning":[5,22,49,61,81,93],"trees":[6,23,50,62,82],"for":[7],"evolutionary":[8,40],"search":[9],"are":[10,116,127],"those":[11,75,119],"based":[12],"on":[13,24,85,138],"bijections":[14],"between":[15],"Pr\u00fcfer":[16],"strings---strings":[17],"n-2":[19],"vertex":[20],"labels---and":[21],"labeled":[26],"vertices.":[27],"One":[28],"these":[30],"bijections,":[31],"called":[32],"Blob":[34,65],"Code,":[35],"showed":[36],"promise":[37],"as":[38,83],"an":[39],"coding,":[41],"but":[42,113],"EAs":[43],"that":[44,59,79],"use":[45],"it":[46],"to":[47,118,130],"represent":[48],"have":[51,101],"not":[52],"performed":[53],"well.":[54],"Here,":[55],"a":[56,77,134],"genetic":[57],"algorithm":[58],"represents":[60],"via":[63],"Code":[66],"is":[67],"faster":[68],"than,":[69],"and":[70,124],"returns":[71],"results":[72,115],"competitive":[73],"with":[74,133],"of,":[76],"GA":[78,108],"encodes":[80],"edge-sets":[84],"Euclidean":[86],"instances":[87,97],"minimum":[90],"routing":[91],"cost":[92],"tree":[94],"problem.":[95],"On":[96],"whose":[98],"edge":[99],"weights":[100],"been":[102],"chosen":[103],"at":[104],"random,":[105],"Blob-coded":[107],"maintains":[109],"its":[110,114],"time":[111],"advantage,":[112],"inferior":[117],"edge-set-coded":[122],"GA,":[123],"both":[125],"GAs":[126],"hard":[128],"pressed":[129],"keep":[131],"up":[132],"simple":[135],"stochastic":[136],"hill-climber":[137],"all":[139],"test":[141],"instances.":[142]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}