{"id":"https://openalex.org/W2955320040","doi":"https://doi.org/10.1145/3321707.3321772","title":"The massively parallel mixing genetic algorithm for the traveling salesman problem","display_name":"The massively parallel mixing genetic algorithm for the traveling salesman problem","publication_year":2019,"publication_date":"2019-07-13","ids":{"openalex":"https://openalex.org/W2955320040","doi":"https://doi.org/10.1145/3321707.3321772","mag":"2955320040"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3321707.3321772","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,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5068552902","display_name":"Swetha Varadarajan","orcid":null},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I4210131357","https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Swetha Varadarajan","raw_affiliation_string":"Computer Science, Colorado State University#TAB#","raw_affiliation_strings":["Computer Science, Colorado State University#TAB#"]},{"author_position":"last","author":{"id":"https://openalex.org/A5001932161","display_name":"Darrell Whitley","orcid":"https://orcid.org/0000-0002-2752-6534"},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I4210131357","https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Darrell Whitley","raw_affiliation_string":"Computer Science, Colorado State University#TAB#","raw_affiliation_strings":["Computer Science, Colorado State University#TAB#"]}],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":3,"cited_by_percentile_year":{"min":78,"max":81},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Swarm Intelligence Optimization Algorithms","score":0.9997,"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":"Swarm Intelligence Optimization Algorithms","score":0.9997,"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":"Application of Genetic Programming in Machine Learning","score":0.9907,"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/T10567","display_name":"Vehicle Routing Problem and Variants","score":0.9809,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"keyword":"genetic algorithm","score":0.6473},{"keyword":"parallel","score":0.3687},{"keyword":"mixing","score":0.3111}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.86624914},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.649454},{"id":"https://openalex.org/C138777275","wikidata":"https://www.wikidata.org/wiki/Q6884054","display_name":"Mixing (physics)","level":2,"score":0.5876554},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.5314255},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.49533334},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.47419387},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3779278},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33215427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2019363},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09561217},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.07950801},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3321707.3321772","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,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"referenced_works_count":6,"referenced_works":["https://openalex.org/W1561636111","https://openalex.org/W1981734705","https://openalex.org/W2045762758","https://openalex.org/W2102281241","https://openalex.org/W2117396900","https://openalex.org/W2137042221"],"related_works":["https://openalex.org/W1542309263","https://openalex.org/W119040397","https://openalex.org/W148823471","https://openalex.org/W2943946372","https://openalex.org/W2356976268","https://openalex.org/W1484312685","https://openalex.org/W3094049162","https://openalex.org/W2366076337","https://openalex.org/W2253106201","https://openalex.org/W2622518229"],"ngrams_url":"https://api.openalex.org/works/W2955320040/ngrams","abstract_inverted_index":{"A":[0],"new":[1],"evolutionary":[2],"algorithm":[3],"called":[4],"the":[5,12,27,30,56,61,78,106,110,124,149,157,162,169],"Mixing":[6,17,74,125,137,150,170],"Genetic":[7,18,75,126,138,151,171],"Algorithm":[8,19,76,127,139,152,172],"is":[9,37,42,101],"introduced":[10],"for":[11,161],"Traveling":[13,163],"Salesman":[14,164],"Problem.":[15],"The":[16,34,73,136],"does":[20],"not":[21],"use":[22],"selection":[23],"or":[24,96],"mutation,":[25],"and":[26,44,60,143],"children":[28],"replace":[29],"parents":[31],"every":[32],"generation.":[33,112],"recombination":[35],"operator":[36],"partition":[38],"crossover.":[39],"Partition":[40],"crossover":[41],"respectful":[43],"transmits":[45],"alleles":[46],"(edges);":[47],"this":[48,118],"makes":[49,119],"it":[50,120],"possible":[51,58,63,121],"to":[52,104,122,153],"generate":[53],"two":[54],"offspring,":[55,64],"best":[57,158],"offspring":[59],"worst":[62],"such":[65],"that":[66,81],"no":[67,92,102],"edges":[68,93],"are":[69,84,94],"lost":[70,95],"during":[71,98],"recombination.":[72],"organizes":[77],"population":[79],"so":[80],"better":[82],"solutions":[83,175],"usually":[85],"recombined":[86],"with":[87,133],"other":[88],"good":[89],"solutions.":[90],"Because":[91],"created":[97],"recombination,":[99],"there":[100],"need":[103],"access":[105],"evaluation":[107],"function":[108],"after":[109],"first":[111],"This":[113],"dramatically":[114],"reduces":[115],"communication":[116],"costs;":[117],"implement":[123],"on":[128],"massively":[129],"parallel":[130],"SIMD":[131],"machines":[132],"limited":[134],"memory.":[135],"never":[140],"loses":[141],"diversity":[142],"cannot":[144],"prematurely":[145],"converge.":[146],"We":[147],"compare":[148],"EAX,":[154],"one":[155],"of":[156],"inexact":[159],"solvers":[160],"Problems.":[165],"For":[166],"many":[167],"problems":[168],"finds":[173],"optimal":[174],"using":[176],"fewer":[177],"recombinations":[178],"than":[179],"EAX.":[180]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2955320040","counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2024-03-03T11:53:48.361607","created_date":"2019-07-12"}