{"id":"https://openalex.org/W2869396925","doi":"https://doi.org/10.1109/access.2018.2853129","title":"A Hierarchical Algorithm Based on Density Peaks Clustering and Ant Colony Optimization for Traveling Salesman Problem","display_name":"A Hierarchical Algorithm Based on Density Peaks Clustering and Ant Colony Optimization for Traveling Salesman Problem","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2869396925","doi":"https://doi.org/10.1109/access.2018.2853129","mag":"2869396925"},"language":"en","primary_location":{"id":"doi:10.1109/access.2018.2853129","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2018.2853129","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2018.2853129","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007919120","display_name":"Erchong Liao","orcid":"https://orcid.org/0000-0002-7018-5317"},"institutions":[{"id":"https://openalex.org/I153473198","display_name":"North China Electric Power University","ror":"https://ror.org/04qr5t414","country_code":"CN","type":"education","lineage":["https://openalex.org/I153473198"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Erchong Liao","raw_affiliation_strings":["School of Control and Computer Engineering, North China Electric Power University, Baoding, China"],"raw_orcid":"https://orcid.org/0000-0002-7018-5317","affiliations":[{"raw_affiliation_string":"School of Control and Computer Engineering, North China Electric Power University, Baoding, China","institution_ids":["https://openalex.org/I153473198"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047750313","display_name":"Changan Liu","orcid":"https://orcid.org/0000-0003-1704-1004"},"institutions":[{"id":"https://openalex.org/I153473198","display_name":"North China Electric Power University","ror":"https://ror.org/04qr5t414","country_code":"CN","type":"education","lineage":["https://openalex.org/I153473198"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Changan Liu","raw_affiliation_strings":["School of Control and Computer Engineering, North China Electric Power University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Control and Computer Engineering, North China Electric Power University, Beijing, China","institution_ids":["https://openalex.org/I153473198"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007919120"],"corresponding_institution_ids":["https://openalex.org/I153473198"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":7.8241,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.97685025,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"6","issue":null,"first_page":"38921","last_page":"38933"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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.9990000128746033,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9876999855041504,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8687217831611633},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7323036193847656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5979962944984436},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5718492269515991},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5424644947052002},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5419638156890869},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5365272760391235},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4527485966682434},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4439457654953003},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4215611219406128},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.343273788690567},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15880432724952698},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.05055767297744751}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8687217831611633},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7323036193847656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5979962944984436},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5718492269515991},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5424644947052002},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5419638156890869},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5365272760391235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4527485966682434},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4439457654953003},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4215611219406128},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.343273788690567},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15880432724952698},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.05055767297744751},{"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/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2018.2853129","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2018.2853129","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:93ce71a252084436aa2eb391331cd088","is_oa":true,"landing_page_url":"https://doaj.org/article/93ce71a252084436aa2eb391331cd088","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 6, Pp 38921-38933 (2018)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2018.2853129","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2018.2853129","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5198758464","display_name":null,"funder_award_id":"2016MS121","funder_id":"https://openalex.org/F4320335787","funder_display_name":"Fundamental Research Funds for the Central Universities"}],"funders":[{"id":"https://openalex.org/F4320335787","display_name":"Fundamental Research Funds for the Central Universities","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W168996728","https://openalex.org/W312143797","https://openalex.org/W1159202373","https://openalex.org/W1484312685","https://openalex.org/W1945980349","https://openalex.org/W1968523955","https://openalex.org/W1969628616","https://openalex.org/W1971084192","https://openalex.org/W1977556410","https://openalex.org/W1979426314","https://openalex.org/W1985440868","https://openalex.org/W1993992568","https://openalex.org/W2010375451","https://openalex.org/W2027486685","https://openalex.org/W2031736545","https://openalex.org/W2034027189","https://openalex.org/W2039069560","https://openalex.org/W2044466855","https://openalex.org/W2047057401","https://openalex.org/W2052257324","https://openalex.org/W2052396508","https://openalex.org/W2074195549","https://openalex.org/W2079012818","https://openalex.org/W2085626585","https://openalex.org/W2105112568","https://openalex.org/W2107941094","https://openalex.org/W2116098622","https://openalex.org/W2119233436","https://openalex.org/W2124993036","https://openalex.org/W2154929945","https://openalex.org/W2165232124","https://openalex.org/W2165835468","https://openalex.org/W2167580124","https://openalex.org/W2171098336","https://openalex.org/W2171211995","https://openalex.org/W2297395784","https://openalex.org/W2417637069","https://openalex.org/W2514131115","https://openalex.org/W2515159839","https://openalex.org/W2534659209","https://openalex.org/W2540697933","https://openalex.org/W2555005230","https://openalex.org/W2583603977","https://openalex.org/W2606019716","https://openalex.org/W2623214827","https://openalex.org/W2755170405","https://openalex.org/W2783169540","https://openalex.org/W6606838835","https://openalex.org/W6671996464","https://openalex.org/W6697634807","https://openalex.org/W6728685256"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2352794675","https://openalex.org/W4385871958","https://openalex.org/W1997193297","https://openalex.org/W4245157707","https://openalex.org/W3159037256","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W2406404685","https://openalex.org/W2369428395"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposed":[2,132],"a":[3,24,56],"hierarchical":[4],"hybrid":[5],"algorithm":[6,133],"for":[7,149],"traveling":[8],"salesman":[9],"problem":[10,20,119],"(TSP)":[11],"according":[12],"to":[13,73],"the":[14,46,62,75,80,84,90,96,116,131,136,150],"idea":[15],"of":[16,52,68,118],"divide-and-conquer.":[17],"The":[18,49,126],"TSP":[19,58,93,153],"is":[21,37,45,99],"decomposed":[22],"into":[23,112],"few":[25],"subproblems":[26,54,70],"with":[27,138],"small-scale":[28],"nodes":[29,51,86],"by":[30,39,101],"density":[31],"peaks":[32],"clustering":[33],"algorithm.":[34],"Every":[35],"subproblem":[36],"resolved":[38],"ant":[40],"colony":[41],"optimization":[42],"algorithm,":[43],"this":[44],"lower":[47],"layer.":[48,64],"center":[50,85],"all":[53],"constitute":[55],"new":[57],"problem,":[59],"which":[60],"forms":[61],"upper":[63,91],"All":[65],"local":[66],"tours":[67],"these":[69],"are":[71,87,110],"joined":[72],"generate":[74],"initial":[76],"global":[77,97],"tour":[78,98],"in":[79,89],"same":[81],"order":[82],"that":[83,130],"traversed":[88],"layer":[92],"problem.":[94,154],"Finally,":[95],"optimized":[100],"k-Opt":[102],"algorithms.":[103],"Thirty":[104],"benchmark":[105],"instances":[106],"taken":[107],"from":[108],"TSPLIB":[109],"divided":[111],"three":[113],"groups":[114],"on":[115],"basis":[117],"size:":[120],"small-scale,":[121],"large-scale,":[122],"and":[123,141,144],"very":[124,151],"large-scale.":[125],"experimental":[127],"result":[128],"shows":[129],"can":[134],"obtain":[135],"solutions":[137],"higher":[139],"accuracy":[140],"stronger":[142],"robustness,":[143],"significantly":[145],"reduce":[146],"runtime,":[147],"especially":[148],"large-scale":[152]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":9}],"updated_date":"2026-05-28T09:10:13.091523","created_date":"2025-10-10T00:00:00"}