{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T10:21:35Z","timestamp":1790936495192,"version":"4.1.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673258"],"award-info":[{"award-number":["61673258"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61075115"],"award-info":[{"award-number":["61075115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61403249"],"award-info":[{"award-number":["61403249"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61603242"],"award-info":[{"award-number":["61603242"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2949860","type":"journal-article","created":{"date-parts":[[2019,10,28]],"date-time":"2019-10-28T23:29:28Z","timestamp":1572305368000},"page":"157303-157317","source":"Crossref","is-referenced-by-count":50,"title":["Multi-Colony Ant Colony Optimization Based on Generalized Jaccard Similarity Recommendation Strategy"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4271-9748","authenticated-orcid":false,"given":"Dehui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3879-6329","authenticated-orcid":false,"given":"Xiaoming","family":"You","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5790-4324","authenticated-orcid":false,"given":"Sheng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9498-9694","authenticated-orcid":false,"given":"Kang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","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":"ref38","first-page":"20","article-title":"Ant colony algorithm for heuristic dynamic pheromone update strategy","volume":"54","author":"zhongqiang","year":"2018","journal-title":"Comput Eng Appl"},{"key":"ref33","first-page":"2220","article-title":"Ant colony algorithm with recommendation of task allocation problems","volume":"19","author":"yan","year":"2013","journal-title":"Comput Integr Manuf Syst"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.07.124"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.09.045"},{"key":"ref30","first-page":"3286","article-title":"Fast particle swarm multimodal optimization algorithm based on multi-population","volume":"35","author":"chen","year":"2018","journal-title":"Appl Res Comput"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2900029"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2915673"},{"key":"ref35","first-page":"44","article-title":"Genetic and ant colony collaborative optimization algorithm based on information entropy and chaos theory","volume":"26","author":"xue","year":"2011","journal-title":"Control Decis"},{"key":"ref34","first-page":"1121","article-title":"Improved artificial bee colony algorithm based on information entropy","volume":"30","author":"li","year":"2015","journal-title":"Control Decis"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2897580"},{"key":"ref40","first-page":"2767","article-title":"Improved particle swarm optimization algorithm based on Hamming distance for traveling salesman problem","volume":"37","author":"qian","year":"2017","journal-title":"J Comput Appl"},{"key":"ref11","first-page":"138","article-title":"Approach to solve TSP with parallel ACS-2-opt","volume":"45","author":"li","year":"2018","journal-title":"Comput Sci"},{"key":"ref12","first-page":"1882","article-title":"An improved ant colony optimization algorithm based on bacterial foraging","volume":"40","author":"zhang","year":"2018","journal-title":"Computing in Science & Eng"},{"key":"ref13","first-page":"782","article-title":"Ant algorithm based on direction-coordinating","volume":"28","author":"meng","year":"2013","journal-title":"Control Decis"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.01.068"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","article-title":"A parallel cooperative hybrid method based on ant colony optimization and 3-opt algorithm for solving traveling salesman problem","volume":"22","author":"?aban","year":"2018","journal-title":"Soft Comput"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.02.014"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.12.015"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17747-2_45"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2991\/ifsa-eusflat-15.2015.108"},{"key":"ref28","first-page":"37","article-title":"Adaptive heterogeneous multiple ant colonies algorithm based on similarity","volume":"50","author":"zhang","year":"2014","journal-title":"Comput Eng Appl"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICBNMT.2013.6823904"},{"key":"ref27","first-page":"36","article-title":"Dual population ant colony algorithm based on heterogeneous ant colonies","volume":"45","author":"he","year":"2009","journal-title":"Comput Eng Appl"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICNISC.2016.041"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref29","first-page":"1858","article-title":"A multi-population based self-adaptive migration PSO","volume":"46","author":"deng","year":"2018","journal-title":"ACTA Electron Sinica"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.10.012"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.329691"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.02.017"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CIS.2016.0052"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.09.040"},{"key":"ref22","first-page":"63","article-title":"MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows","author":"gambardella","year":"1999","journal-title":"New Ideas in Optimization"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.12.002"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.02.017"},{"key":"ref41","first-page":"2694","article-title":"Fuzzy artificial bees colony algorithm for solving traveling salesman problem","volume":"30","author":"liu","year":"2013","journal-title":"Appl Res Comput"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2003.10.013"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-8944-2_54"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2746569"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08884122.pdf?arnumber=8884122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T02:33:11Z","timestamp":1643164391000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8884122\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2949860","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}