{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:13:12Z","timestamp":1781086392864,"version":"3.54.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2016MS121"],"award-info":[{"award-number":["2016MS121"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2853129","type":"journal-article","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T18:29:59Z","timestamp":1530815399000},"page":"38921-38933","source":"Crossref","is-referenced-by-count":58,"title":["A Hierarchical Algorithm Based on Density Peaks Clustering and Ant Colony Optimization for Traveling Salesman Problem"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7018-5317","authenticated-orcid":false,"given":"Erchong","family":"Liao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.782657"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-4642-1_10"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.01.068"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12436-0_28"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.3906\/elk-1109-44"},{"key":"ref37","first-page":"134","article-title":"Distributed optimization by ant colonies","author":"colorni","year":"1991","journal-title":"Proc ECAL"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1126\/science.1242072"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","article-title":"Clustering by passing messages between data points","volume":"315","author":"frey","year":"2007","journal-title":"Science"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.04.163"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.07.054"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2432-3"},{"key":"ref2","first-page":"148","article-title":"Comparing a hybrid branch and bound algorithm with evolutionary computation methods, local search and their hybrids on the TSP","author":"yan","year":"2014","journal-title":"Proc CIPLS"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.pnsc.2008.01.030"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.01.015"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1631\/FITEE.1601364"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.06.007"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.01.039"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.09.008"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-014-1279-8"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-011-0794-0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2006.11.035"},{"key":"ref40","first-page":"812","article-title":"Ant colony optimization (ACO) meta-heuristic solving the vehicle scheduling problem (VSP)","author":"vlachos","year":"2006","journal-title":"Proc WSEAS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.03.004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(02)00179-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2004.02.006"},{"key":"ref15","first-page":"796","article-title":"A parallel adaptive tabu search approach for traveling salesman problems","author":"he","year":"2005","journal-title":"Proc IEEE NLP-KE"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISDA.2008.346"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/854218"},{"key":"ref18","first-page":"126","article-title":"Performance water flow-like algorithm for TSP by improving its local search","volume":"5","author":"othman","year":"2013","journal-title":"Int J Adv Comput Technol"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1016\/j.asoc.2015.06.011","article-title":"Parallelized neural network system for solving Euclidean traveling salesman problem","volume":"34","author":"av?ar","year":"2015","journal-title":"Appl Soft Comput"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.3.316"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.09.013"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICIS.2016.7550780"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2005.10.002"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.01.053"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2015.7257285"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21434-9_8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.08.036"},{"key":"ref46","author":"reinelt","year":"2017","journal-title":"Tsplib discrete and combinatorial optimization"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1002\/net.21512"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLC.2006.258954"},{"key":"ref47","first-page":"149","article-title":"Experimental study of the adjustable parameters in basic ant colony optimization algorithm","author":"duan","year":"2007","journal-title":"Proc CEC"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12071"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.04.007"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0205"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2161-7"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08404041.pdf?arnumber=8404041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:14:24Z","timestamp":1642004064000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8404041\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2853129","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}