{"id":"https://openalex.org/W7126222526","doi":"https://doi.org/10.1007/s00521-025-11706-4","title":"Scalable parallel memetic algorithms for large close-enough traveling salesman problems","display_name":"Scalable parallel memetic algorithms for large close-enough traveling salesman problems","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7126222526","doi":"https://doi.org/10.1007/s00521-025-11706-4"},"language":"en","primary_location":{"id":"doi:10.1007/s00521-025-11706-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00521-025-11706-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00521-025-11706-4.pdf","source":{"id":"https://openalex.org/S147897268","display_name":"Neural Computing and Applications","issn_l":"0941-0643","issn":["0941-0643","1433-3058"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computing and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00521-025-11706-4.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075886891","display_name":"Deniz Canturk","orcid":"https://orcid.org/0000-0002-7606-8701"},"institutions":[{"id":"https://openalex.org/I4210115299","display_name":"TED University","ror":"https://ror.org/0285rh439","country_code":"TR","type":"education","lineage":["https://openalex.org/I4210115299"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Deniz Canturk","raw_affiliation_strings":["Department of Software Engineering, TED University, Ankara, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Software Engineering, TED University, Ankara, Turkey","institution_ids":["https://openalex.org/I4210115299"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120513940","display_name":"Tansel D\u00f6kero\u011flu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210115299","display_name":"TED University","ror":"https://ror.org/0285rh439","country_code":"TR","type":"education","lineage":["https://openalex.org/I4210115299"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Tansel D\u00f6kero\u011flu","raw_affiliation_strings":["Department of Software Engineering, TED University, Ankara, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Software Engineering, TED University, Ankara, Turkey","institution_ids":["https://openalex.org/I4210115299"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075886891"],"corresponding_institution_ids":["https://openalex.org/I4210115299"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34579086,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.6028000116348267,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.6028000116348267,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.12540000677108765,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.033900000154972076,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/memetic-algorithm","display_name":"Memetic algorithm","score":0.8741000294685364},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8126000165939331},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7427999973297119},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6822999715805054},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.5922999978065491},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5896999835968018},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44859999418258667},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.39739999175071716},{"id":"https://openalex.org/keywords/memetics","display_name":"Memetics","score":0.37279999256134033}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.8741000294685364},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8126000165939331},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7427999973297119},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7383999824523926},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6822999715805054},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.5922999978065491},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5896999835968018},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5353999733924866},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44859999418258667},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.39739999175071716},{"id":"https://openalex.org/C51620047","wikidata":"https://www.wikidata.org/wiki/Q23399","display_name":"Memetics","level":2,"score":0.37279999256134033},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3650999963283539},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3619999885559082},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3546999990940094},{"id":"https://openalex.org/C68597687","wikidata":"https://www.wikidata.org/wiki/Q362601","display_name":"Computational Science and Engineering","level":2,"score":0.34450000524520874},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.3361999988555908},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.3337000012397766},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33070001006126404},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.3127000033855438},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.2791000008583069},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2583000063896179},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.2538999915122986},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2529999911785126},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00521-025-11706-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00521-025-11706-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00521-025-11706-4.pdf","source":{"id":"https://openalex.org/S147897268","display_name":"Neural Computing and Applications","issn_l":"0941-0643","issn":["0941-0643","1433-3058"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computing and Applications","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00521-025-11706-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00521-025-11706-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00521-025-11706-4.pdf","source":{"id":"https://openalex.org/S147897268","display_name":"Neural Computing and Applications","issn_l":"0941-0643","issn":["0941-0643","1433-3058"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computing and Applications","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7400416731834412,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7126222526.pdf","grobid_xml":"https://content.openalex.org/works/W7126222526.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W1571087346","https://openalex.org/W2008316291","https://openalex.org/W2008434012","https://openalex.org/W2017708378","https://openalex.org/W2018702978","https://openalex.org/W2062957360","https://openalex.org/W2098677401","https://openalex.org/W2108801243","https://openalex.org/W2135331367","https://openalex.org/W2138150574","https://openalex.org/W2139434217","https://openalex.org/W2142740248","https://openalex.org/W2148673189","https://openalex.org/W2152195021","https://openalex.org/W2163428398","https://openalex.org/W2253899129","https://openalex.org/W2516530272","https://openalex.org/W2519109668","https://openalex.org/W2528929878","https://openalex.org/W2734835295","https://openalex.org/W2803452670","https://openalex.org/W2884583022","https://openalex.org/W2972093761","https://openalex.org/W3063913079","https://openalex.org/W3094704314","https://openalex.org/W4211036921","https://openalex.org/W4224222848","https://openalex.org/W4255486187","https://openalex.org/W4317352054","https://openalex.org/W4319069705","https://openalex.org/W4364355519","https://openalex.org/W4386095125","https://openalex.org/W4387089483","https://openalex.org/W4391264787","https://openalex.org/W4401836256","https://openalex.org/W4405129366","https://openalex.org/W4408063111","https://openalex.org/W4414420807"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"The":[1,77,174],"Close-Enough":[2],"Traveling":[3],"Salesman":[4],"Problem":[5],"(CETSP)":[6],"is":[7,19,28,37,83],"a":[8,22,26,42,74,110,125,160],"complex":[9,186],"variant":[10],"of":[11,80,213],"the":[12,146,165,170,178,189,207,211],"classical":[13],"TSP":[14],"in":[15,164,217],"which":[16],"each":[17],"target":[18],"represented":[20],"by":[21],"disk-shaped":[23],"neighborhood,":[24],"and":[25,55,87,97,119,123,157,209],"visit":[27],"considered":[29],"valid":[30],"if":[31],"any":[32],"point":[33],"within":[34],"that":[35,93,113,129,145,177],"neighborhood":[36],"reached.":[38],"This":[39],"formulation":[40],"provides":[41,181],"more":[43],"realistic":[44],"model":[45],"for":[46,100,185,206],"real-world":[47],"applications":[48],"such":[49],"as":[50],"surveillance,":[51],"wireless":[52],"sensor":[53],"routing,":[54],"Unmanned":[56],"Aerial":[57],"Vehicle":[58],"(UAV)":[59],"path":[60],"planning.":[61],"However,":[62],"due":[63],"to":[64,84,159,169],"its":[65],"NP-hard":[66],"nature,":[67],"solving":[68,218],"large-scale":[69,219],"CETSP":[70,102,208],"instances":[71,143],"efficiently":[72],"remains":[73],"significant":[75],"challenge.":[76],"main":[78],"objective":[79],"this":[81,200],"study":[82,201],"develop":[85],"scalable":[86],"robust":[88],"Parallel":[89],"Memetic":[90],"Algorithms":[91],"(PMAs)":[92],"enhance":[94],"computational":[95],"efficiency":[96],"solution":[98,197],"quality":[99],"large":[101],"instances.":[103],"Two":[104],"complementary":[105],"strategies":[106],"are":[107],"proposed:":[108],"(i)":[109],"Multi-Population":[111,179],"PMA":[112,128,180,191],"maintains":[114],"diversity":[115],"through":[116],"distributed":[117],"crossover":[118],"parallel":[120,134,214],"local":[121],"optimization,":[122],"(ii)":[124],"Single-Population,":[126],"Multi-Fitness":[127],"accelerates":[130],"convergence":[131,194],"via":[132],"simultaneous":[133],"fitness":[135],"evaluations.":[136],"Extensive":[137],"experiments":[138],"conducted":[139],"on":[140],"42":[141],"benchmark":[142],"demonstrate":[144],"proposed":[147],"algorithms":[148,216],"outperform":[149],"state-of-the-art":[150],"approaches,":[151],"achieving":[152],"21":[153],"new":[154,203],"best-known":[155],"solutions":[156],"up":[158],"10\u201315":[161],"times":[162,167],"reduction":[163],"execution":[166],"compared":[168],"sequential":[171],"MA-CETSP":[172],"algorithm.":[173],"results":[175],"confirm":[176],"superior":[182],"exploration":[183],"capabilities":[184],"instances,":[187],"while":[188],"Single-Population":[190],"delivers":[192],"faster":[193],"with":[195],"comparable":[196],"quality.":[198],"Overall,":[199],"establishes":[202],"performance":[204],"benchmarks":[205],"demonstrates":[210],"effectiveness":[212],"memetic":[215],"combinatorial":[220],"optimization":[221],"problems.":[222]},"counts_by_year":[],"updated_date":"2026-03-12T06:13:28.667946","created_date":"2026-02-01T00:00:00"}