{"id":"https://openalex.org/W2436059898","doi":"https://doi.org/10.1109/siu.2016.7496202","title":"Parallel solution of large scale Traveling Salesman Problems by using clustering and Evolutionary Algorithms","display_name":"Parallel solution of large scale Traveling Salesman Problems by using clustering and Evolutionary Algorithms","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2436059898","doi":"https://doi.org/10.1109/siu.2016.7496202","mag":"2436059898"},"language":"en","primary_location":{"id":"doi:10.1109/siu.2016.7496202","is_oa":false,"landing_page_url":"https://doi.org/10.1109/siu.2016.7496202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 24th Signal Processing and Communication Application Conference (SIU)","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/A5035330469","display_name":"U\u011fur \u00c7ekmez","orcid":"https://orcid.org/0000-0003-2968-092X"},"institutions":[{"id":"https://openalex.org/I4101805","display_name":"Y\u0131ld\u0131z Technical University","ror":"https://ror.org/0547yzj13","country_code":"TR","type":"education","lineage":["https://openalex.org/I4101805"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Ugur Cekmez","raw_affiliation_strings":["Bilgisayar Muhendisligi Bolumu, Yildiz Teknik \u00dcniversitesi, Istanbul, Turkiye"],"affiliations":[{"raw_affiliation_string":"Bilgisayar Muhendisligi Bolumu, Yildiz Teknik \u00dcniversitesi, Istanbul, Turkiye","institution_ids":["https://openalex.org/I4101805"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074737067","display_name":"\u00d6zg\u00fcr Koray \u015eahing\u00f6z","orcid":"https://orcid.org/0000-0002-1588-8220"},"institutions":[{"id":"https://openalex.org/I99312532","display_name":"Turkish Air Force Academy","ror":"https://ror.org/01psaa030","country_code":"TR","type":"education","lineage":["https://openalex.org/I99312532"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Ozgur Koray Sahingoz","raw_affiliation_strings":["Bilgisayar Muhendisligi Bolumu, Hava Harp Okulu Komutanligi, Istanbul, Turkiye"],"affiliations":[{"raw_affiliation_string":"Bilgisayar Muhendisligi Bolumu, Hava Harp Okulu Komutanligi, Istanbul, Turkiye","institution_ids":["https://openalex.org/I99312532"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035330469"],"corresponding_institution_ids":["https://openalex.org/I4101805"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.03189174,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2165","last_page":"2168"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991999864578247,"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.9991999864578247,"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.9908999800682068,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9692000150680542,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8960580825805664},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6830270886421204},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6388559341430664},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5697605609893799},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5534529685974121},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5311585664749146},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.49621158838272095},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.47436651587486267},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4453255236148834},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4419674575328827},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.42775875329971313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4230627417564392},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2595110535621643},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14970284700393677}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8960580825805664},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6830270886421204},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6388559341430664},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5697605609893799},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5534529685974121},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5311585664749146},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.49621158838272095},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.47436651587486267},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4453255236148834},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4419674575328827},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.42775875329971313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4230627417564392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2595110535621643},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14970284700393677},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/siu.2016.7496202","is_oa":false,"landing_page_url":"https://doi.org/10.1109/siu.2016.7496202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 24th Signal Processing and Communication Application Conference (SIU)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W216665683","https://openalex.org/W1507532639","https://openalex.org/W1651093245","https://openalex.org/W2028008861","https://openalex.org/W2082279538","https://openalex.org/W2163428398"],"related_works":["https://openalex.org/W2359992618","https://openalex.org/W2980689483","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W2361554335","https://openalex.org/W1595757466","https://openalex.org/W2362402143","https://openalex.org/W2940752513","https://openalex.org/W99301329","https://openalex.org/W2356976268"],"abstract_inverted_index":{"Evolutionary":[0],"Algorithms":[1],"provide":[2],"reasonable":[3],"speed":[4],"in":[5,51,58,111,131],"time":[6,60],"for":[7,47],"solving":[8,93,114,122],"optimization":[9,56,117],"problems.":[10],"However,":[11],"these":[12,55,94,102],"approaches":[13],"may":[14],"stay":[15],"insufficient":[16],"when":[17],"the":[18,40,73,79,85,107,143,146,151],"problem":[19,41,86,152],"gets":[20,154],"bigger":[21],"and":[22,35,92,99,135],"needs":[23],"more":[24,128],"hardware":[25],"resource.":[26],"Because":[27],"it":[28,68,139],"is":[29,44,69,140],"not":[30],"feasible":[31],"to":[32,53,71,113],"improve":[33],"memory":[34],"computation":[36],"power":[37],"depending":[38],"on":[39],"size,":[42],"there":[43],"a":[45,88],"need":[46],"developing":[48],"new":[49],"techniques":[50],"order":[52],"solve":[54,72],"problems":[57,118],"less":[59],"with":[61,87,96],"smaller":[62],"error":[63],"ratios.":[64],"In":[65,137],"this":[66],"study,":[67],"aimed":[70],"Traveling":[74],"Salesman":[75],"Problem,":[76],"one":[77],"of":[78,145],"NP-complete":[80],"complexity":[81],"problems,":[82,121],"by":[83,124],"partitioning":[84,125],"clustering":[89],"technique,":[90],"K-Means,":[91],"pieces":[95],"Genetic":[97],"Algorithm":[98],"finally":[100],"combining":[101],"solutions":[103],"into":[104],"one.":[105],"As":[106],"experimental":[108],"results":[109,130],"suggest,":[110],"comparison":[112],"large":[115],"scale":[116],"as":[119,150],"single":[120],"them":[123,126],"yields":[127,148],"convincing":[129],"both":[132],"solution":[133],"quality":[134],"time.":[136],"addition,":[138],"observed":[141],"that":[142],"performance":[144],"technique":[147],"better":[149],"size":[153],"bigger.":[155]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}