{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T15:03:17Z","timestamp":1761490997851,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673258","61075115"],"award-info":[{"award-number":["61673258","61075115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Shanghai Natural Science Foundation","doi-asserted-by":"publisher","award":["19ZR1421600"],"award-info":[{"award-number":["19ZR1421600"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3002817","type":"journal-article","created":{"date-parts":[[2020,6,16]],"date-time":"2020-06-16T21:07:06Z","timestamp":1592341626000},"page":"154471-154484","source":"Crossref","is-referenced-by-count":16,"title":["Dynamic Density Clustering Ant Colony Algorithm With Filtering Recommendation Backtracking Mechanism"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5897-9261","authenticated-orcid":false,"given":"Jin","family":"Yu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3879-6329","authenticated-orcid":false,"given":"Xiaoming","family":"You","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5790-4324","authenticated-orcid":false,"given":"Sheng","family":"Liu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","first-page":"114","article-title":"Improved ant colony algorithm for travelling salesman problem","volume":"35","author":"jiang","year":"2015","journal-title":"J Comput Appl"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2853129"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI44817.2019.9003009"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2949860"},{"key":"ref36","first-page":"148","article-title":"Solution for traveling salesman problem with four vertices and three lines genetic algorithm","volume":"53","author":"zheng","year":"2017","journal-title":"Comput Eng Appl"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.09.034"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-014-1279-8"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiolchem.2019.107118"},{"key":"ref11","article-title":"Solving TSP problem in precision agriculture soil survey","author":"yun","year":"0","journal-title":"China Rural Water and Hydropower"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.802452"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2014.06.026"},{"key":"ref16","first-page":"1882","article-title":"Improved ant colony algorithm based on bacterial foraging","volume":"40","author":"zhang","year":"2018","journal-title":"Computing in Science & Eng"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2019.102573"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2016.09.035"},{"key":"ref19","first-page":"782","article-title":"Ant colony algorithm based on directional pheromone coordination","volume":"28","author":"meng","year":"2013","journal-title":"Control Decis"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2432-3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/tee.22247"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2846646"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826067"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E92.D.78"},{"key":"ref29","first-page":"66","article-title":"Self-adaptive double-population ant colony algorithm with entropy","volume":"55","author":"yang","year":"2019","journal-title":"Comput Eng Appl"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e91-d.6.1813"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.329691"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-019-04172-2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-03820-y"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","article-title":"A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem","volume":"30","author":"mahi","year":"2015","journal-title":"Appl Soft Comput"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMR.989-994.2196"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/545391"},{"key":"ref24","first-page":"780","article-title":"Ant colony optimization based on clustering ensemble and TSP algorithm in restricted solution space","volume":"46","author":"pang","year":"2016","journal-title":"J Univ Sci Technol China"},{"key":"ref23","first-page":"1729","article-title":"An object-oriented multi-role ant colony algorithm and its TSP solution","volume":"29","author":"du","year":"2014","journal-title":"Control Decis"},{"journal-title":"MP-TESTDATA-The TSPLIB Symmetric Traveling Salesman Problem Instances","year":"0","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2017.7510415"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09118883.pdf?arnumber=9118883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:52:44Z","timestamp":1639770764000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9118883\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3002817","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}