{"id":"https://openalex.org/W1972654269","doi":"https://doi.org/10.1137/0801031","title":"Parallel Genetic Algorithms Applied to the Traveling Salesman Problem","display_name":"Parallel Genetic Algorithms Applied to the Traveling Salesman Problem","publication_year":1991,"publication_date":"1991-11-01","ids":{"openalex":"https://openalex.org/W1972654269","doi":"https://doi.org/10.1137/0801031","mag":"1972654269"},"language":"en","primary_location":{"id":"doi:10.1137/0801031","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0801031","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-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/A5017884145","display_name":"Prasanna Jog","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Prasanna Jog","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046277811","display_name":"Jung Y. Suh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jung Y. Suh","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110598353","display_name":"Dirk Van Gucht","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dirk Van Gucht","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5017884145"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.553,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.84093668,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"1","issue":"4","first_page":"515","last_page":"529"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9979000091552734,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.795518696308136},{"id":"https://openalex.org/keywords/quality-control-and-genetic-algorithms","display_name":"Quality control and genetic algorithms","score":0.7235395908355713},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6114347577095032},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6053019762039185},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5433353781700134},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5074328780174255},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.49759772419929504},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4971664249897003},{"id":"https://openalex.org/keywords/inefficiency","display_name":"Inefficiency","score":0.4940181374549866},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4700314700603485},{"id":"https://openalex.org/keywords/genetic-representation","display_name":"Genetic representation","score":0.4294032156467438},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4174189567565918},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3651690185070038},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3409191966056824},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.1144249439239502}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.795518696308136},{"id":"https://openalex.org/C161164918","wikidata":"https://www.wikidata.org/wiki/Q7268775","display_name":"Quality control and genetic algorithms","level":4,"score":0.7235395908355713},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6114347577095032},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6053019762039185},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5433353781700134},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5074328780174255},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.49759772419929504},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4971664249897003},{"id":"https://openalex.org/C2778869765","wikidata":"https://www.wikidata.org/wiki/Q6028363","display_name":"Inefficiency","level":2,"score":0.4940181374549866},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4700314700603485},{"id":"https://openalex.org/C6135463","wikidata":"https://www.wikidata.org/wiki/Q5532920","display_name":"Genetic representation","level":3,"score":0.4294032156467438},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4174189567565918},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3651690185070038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3409191966056824},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.1144249439239502},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0801031","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0801031","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W58255779","https://openalex.org/W99032621","https://openalex.org/W132676638","https://openalex.org/W249091067","https://openalex.org/W307896644","https://openalex.org/W1482722110","https://openalex.org/W1485961250","https://openalex.org/W1497256448","https://openalex.org/W1540072641","https://openalex.org/W1560368589","https://openalex.org/W1589975099","https://openalex.org/W1593147179","https://openalex.org/W1604975506","https://openalex.org/W1605945379","https://openalex.org/W1692367225","https://openalex.org/W1992928037","https://openalex.org/W1995467152","https://openalex.org/W2014068360","https://openalex.org/W2019366718","https://openalex.org/W2022306346","https://openalex.org/W2023810448","https://openalex.org/W2029036160","https://openalex.org/W2042986967","https://openalex.org/W2051682049","https://openalex.org/W2061041314","https://openalex.org/W2092297694","https://openalex.org/W2151676833","https://openalex.org/W2154061444","https://openalex.org/W2156698647","https://openalex.org/W2159173424","https://openalex.org/W2912569805","https://openalex.org/W2976664243","https://openalex.org/W3036211873","https://openalex.org/W3139666781"],"related_works":["https://openalex.org/W1553010236","https://openalex.org/W2998167408","https://openalex.org/W2379073824","https://openalex.org/W2354309204","https://openalex.org/W2381977948","https://openalex.org/W2348064796","https://openalex.org/W2367416669","https://openalex.org/W1529798305","https://openalex.org/W2347449522","https://openalex.org/W1999084560"],"abstract_inverted_index":{"Genetic":[0],"algorithms":[1,5,14,34,63,81,84,90,103,134],"are":[2],"adaptive":[3],"search":[4,31],"that":[6,85],"have":[7],"been":[8],"shown":[9],"to":[10,28,64,82,115],"be":[11,92,122,136,147],"robust":[12],"optimization":[13,24],"for":[15],"multimodal":[16],"real-valued":[17],"functions":[18],"and":[19,94,138],"a":[20,42,50,110],"variety":[21],"of":[22,41,44,61,101],"combinatorial":[23],"problems.":[25],"In":[26],"contrast":[27],"more":[29],"standard":[30],"algorithms,":[32,76],"genetic":[33,62,80,83,102,133],"base":[35],"their":[36,95,105,116,139],"progress":[37],"on":[38,49,58,109,125],"the":[39,59,65,142],"performance":[40,96],"population":[43],"candidate":[45,52],"solutions,":[46],"rather":[47],"than":[48],"single":[51],"solution.":[53],"The":[54],"authors":[55],"will":[56,91,135,146],"concentrate":[57],"application":[60],"traveling":[66,143],"salesman":[67,144],"problem.":[68],"For":[69],"this":[70],"problem,":[71],"there":[72],"exist":[73],"several":[74],"such":[75],"ranging":[77],"from":[78],"pure":[79],"incorporate":[86],"heuristic":[87],"information.":[88],"These":[89],"reviewed":[93,137],"contrasted.":[97],"A":[98],"serious":[99],"drawback":[100],"is":[104],"inefficiency":[106],"when":[107],"implemented":[108,124],"sequential":[111],"machine.":[112],"However,":[113],"due":[114],"inherent":[117],"parallel":[118,126],"properties,":[119],"they":[120],"can":[121],"successfully":[123],"machines,":[127],"resulting":[128],"in":[129,141],"considerable":[130],"speedup.":[131],"Parallel":[132],"uses":[140],"problem":[145],"indicated.":[148]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}