{"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-03","ids":{"openalex":"https://openalex.org/W2955320040","doi":"https://doi.org/10.1145/3321707.3321772","mag":"2955320040"},"language":"en","primary_location":{"id":"doi:10.1145/3321707.3321772","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,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","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/A5068552902","display_name":"Swetha Varadarajan","orcid":"https://orcid.org/0000-0002-0256-7639"},"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/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Swetha Varadarajan","raw_affiliation_strings":["Computer Science, Colorado State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science, Colorado State University","institution_ids":["https://openalex.org/I92446798"]}]},{"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/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Darrell Whitley","raw_affiliation_strings":["Computer Science, Colorado State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science, Colorado State University","institution_ids":["https://openalex.org/I92446798"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I92446798"],"apc_list":null,"apc_paid":null,"fwci":0.439,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.6603108,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"872","last_page":"879"},"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.9930999875068665,"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 Optimization Methods","score":0.9853000044822693,"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":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.8780159950256348},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8365834951400757},{"id":"https://openalex.org/keywords/mixing","display_name":"Mixing (physics)","score":0.6711519956588745},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6062380075454712},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5702320337295532},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5268812775611877},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.48415929079055786},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4668368101119995},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46340298652648926},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4352218210697174},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.342963844537735},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.321768581867218},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14916658401489258},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1285698413848877},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07760244607925415}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8780159950256348},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8365834951400757},{"id":"https://openalex.org/C138777275","wikidata":"https://www.wikidata.org/wiki/Q6884054","display_name":"Mixing (physics)","level":2,"score":0.6711519956588745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6062380075454712},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5702320337295532},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5268812775611877},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.48415929079055786},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4668368101119995},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46340298652648926},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4352218210697174},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.342963844537735},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.321768581867218},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14916658401489258},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1285698413848877},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07760244607925415},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3321707.3321772","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,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W54221576","https://openalex.org/W656060844","https://openalex.org/W1561636111","https://openalex.org/W1568268653","https://openalex.org/W1717440967","https://openalex.org/W1981734705","https://openalex.org/W2045762758","https://openalex.org/W2102281241","https://openalex.org/W2117396900","https://openalex.org/W2137042221","https://openalex.org/W2148948822","https://openalex.org/W2305224893","https://openalex.org/W2890337345","https://openalex.org/W2924572169"],"related_works":["https://openalex.org/W2153505252","https://openalex.org/W3104258108","https://openalex.org/W2114549389","https://openalex.org/W4376138746","https://openalex.org/W4389782626","https://openalex.org/W2361554335","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2359992618","https://openalex.org/W4200179302"],"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]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-08-25T07:29:55.448023","created_date":"2025-10-10T00:00:00"}