{"id":"https://openalex.org/W7126099536","doi":"https://doi.org/10.1109/comcomap68359.2025.11353146","title":"Multiple Population Adaptive Memetic Algorithm for Solving the Traveling Salesman Problem","display_name":"Multiple Population Adaptive Memetic Algorithm for Solving the Traveling Salesman Problem","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7126099536","doi":"https://doi.org/10.1109/comcomap68359.2025.11353146"},"language":null,"primary_location":{"id":"doi:10.1109/comcomap68359.2025.11353146","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comcomap68359.2025.11353146","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Computing, Communications and IoT Applications (ComComAp)","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/A5066072626","display_name":"Renqi Zhu","orcid":"https://orcid.org/0000-0002-9221-0413"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Renqi Zhu","raw_affiliation_strings":["National University of Defense Technology,College of Systems Engineering,Changsha,China"],"affiliations":[{"raw_affiliation_string":"National University of Defense Technology,College of Systems Engineering,Changsha,China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024341911","display_name":"Anqi Ye","orcid":null},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Anqi Ye","raw_affiliation_strings":["National University of Defense Technology,College of Systems Engineering,Changsha,China"],"affiliations":[{"raw_affiliation_string":"National University of Defense Technology,College of Systems Engineering,Changsha,China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073492398","display_name":"Lin Pan","orcid":null},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lin Pan","raw_affiliation_strings":["National University of Defense Technology,College of Systems Engineering,Changsha,China"],"affiliations":[{"raw_affiliation_string":"National University of Defense Technology,College of Systems Engineering,Changsha,China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124222405","display_name":"Yun Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yun Zhou","raw_affiliation_strings":["National University of Defense Technology,College of Systems Engineering,Changsha,China"],"affiliations":[{"raw_affiliation_string":"National University of Defense Technology,College of Systems Engineering,Changsha,China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034260336","display_name":"Lin Xiang","orcid":"https://orcid.org/0009-0000-1842-5283"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"LIN Xiang","raw_affiliation_strings":["National University of Defense Technology,College of Systems Engineering,Changsha,China"],"affiliations":[{"raw_affiliation_string":"National University of Defense Technology,College of Systems Engineering,Changsha,China","institution_ids":["https://openalex.org/I170215575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5066072626"],"corresponding_institution_ids":["https://openalex.org/I170215575"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.8741133,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"30","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.8826000094413757,"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.8826000094413757,"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.07050000131130219,"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.019600000232458115,"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/memetic-algorithm","display_name":"Memetic algorithm","score":0.8270000219345093},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7932000160217285},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.7519999742507935},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6579999923706055},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.6152999997138977},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.5260000228881836},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5216000080108643},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5138000249862671},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4957999885082245},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.49540001153945923}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.8270000219345093},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7932000160217285},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7519999742507935},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.713100016117096},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6579999923706055},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.6152999997138977},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.5260000228881836},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5216000080108643},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5138000249862671},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4957999885082245},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.49540001153945923},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49300000071525574},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.47369998693466187},{"id":"https://openalex.org/C165661538","wikidata":"https://www.wikidata.org/wiki/Q7829327","display_name":"Tournament selection","level":3,"score":0.46700000762939453},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.43860000371932983},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4307999908924103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4302000105381012},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.41839998960494995},{"id":"https://openalex.org/C51620047","wikidata":"https://www.wikidata.org/wiki/Q23399","display_name":"Memetics","level":2,"score":0.3984000086784363},{"id":"https://openalex.org/C192122231","wikidata":"https://www.wikidata.org/wiki/Q4680754","display_name":"Adaptive mutation","level":3,"score":0.38260000944137573},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.3765999972820282},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.3598000109195709},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3458000123500824},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3147999942302704},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.2976999878883362},{"id":"https://openalex.org/C167393769","wikidata":"https://www.wikidata.org/wiki/Q4680768","display_name":"Adaptive strategies","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.2703000009059906},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.2551000118255615},{"id":"https://openalex.org/C169733012","wikidata":"https://www.wikidata.org/wiki/Q1613416","display_name":"Population size","level":3,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/comcomap68359.2025.11353146","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comcomap68359.2025.11353146","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Computing, Communications and IoT Applications (ComComAp)","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/W1990771923","https://openalex.org/W2150367356","https://openalex.org/W3081775163","https://openalex.org/W4391253264","https://openalex.org/W4393234433","https://openalex.org/W4408363395"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,30,49,66],"Multiple":[4],"Population":[5],"Adaptive":[6],"Memetic":[7],"Algorithm":[8],"(MPAMA)":[9],"for":[10,89,105],"efficient":[11],"Traveling":[12],"Salesman":[13],"Problem":[14],"(TSP)":[15],"optimization,":[16],"integrating":[17],"genetic":[18],"algorithms":[19],"with":[20,130],"2-opt":[21,71],"local":[22],"search":[23],"and":[24,40,57,64,96,135],"introducing":[25],"three":[26],"key":[27],"innovations:":[28],"(1)":[29],"dual":[31,50],"adaptive":[32],"mutation":[33,36],"mechanism":[34],"where":[35],"rate":[37],"decays":[38],"exponentially":[39],"intensity":[41],"adjusts":[42],"dynamically":[43],"based":[44],"on":[45,80],"convergence":[46],"detection,":[47],"(2)":[48],"elite":[51,77],"retention":[52],"strategy":[53],"performing":[54],"selection":[55],"before":[56],"after":[58],"crossover":[59],"to":[60,73],"preserve":[61],"historical":[62],"optima,":[63],"(3)":[65],"hybrid":[67],"framework":[68],"applying":[69],"intensive":[70],"refinement":[72],"the":[74,119,123],"top":[75],"10%":[76],"solutions.":[78],"Evaluated":[79],"12":[81],"benchmark":[82],"instances,":[83],"MPAMA":[84],"achieves":[85],"known":[86],"optimal":[87],"solutions":[88],"unimodal":[90],"cases,":[91],"maintains":[92],"high":[93],"solution":[94],"diversity":[95],"quality-diversity":[97],"balance":[98],"(mean":[99],"F<inf":[100],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[101],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u03b2</inf>":[102],"=":[103],"0.9014)":[104],"multimodal":[106],"problems,":[107],"while":[108],"demonstratinto":[109],"large-scale":[110],"instances.":[111],"The":[112],"algorithm\u2019s":[113],"effectiveness":[114],"was":[115],"validated":[116],"by":[117],"winning":[118],"\"Excellent\"":[120],"award":[121],"in":[122],"2025":[124],"Soyotec":[125],"Chinese":[126],"Intelligent":[127],"Optimization":[128],"Competition,":[129],"future":[131],"work":[132],"targeting":[133],"ultra-large-scale":[134],"dynamic":[136],"TSP":[137],"extensions.":[138]},"counts_by_year":[],"updated_date":"2026-02-01T03:34:12.195049","created_date":"2026-01-30T00:00:00"}