{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T18:16:05Z","timestamp":1773944165810,"version":"3.50.1"},"reference-count":34,"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":"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\/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.3009399","type":"journal-article","created":{"date-parts":[[2020,7,15]],"date-time":"2020-07-15T20:57:31Z","timestamp":1594846651000},"page":"129958-129974","source":"Crossref","is-referenced-by-count":57,"title":["Dynamic Multi-Role Adaptive Collaborative Ant Colony Optimization for Robot Path Planning"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4271-9748","authenticated-orcid":false,"given":"Dehui","family":"Zhang","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":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5447-2156","authenticated-orcid":false,"given":"Han","family":"Pan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105887"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2432-3"},{"key":"ref31","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":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2900029"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2967076"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2746569"},{"key":"ref11","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":"ref12","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":"ref13","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":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2768665"},{"key":"ref15","first-page":"1767","article-title":"Ant colony algorithm based on negative feedback and its application on robot path planning","volume":"25","author":"bai","year":"2019","journal-title":"Comput Integr Manuf Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2161-7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2723892"},{"key":"ref18","first-page":"44","article-title":"Improved simulated annealing genetic algorithm for solving TSP problem","volume":"46","author":"wang","year":"2010","journal-title":"Comput Eng Appl"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2017.10.011","article-title":"Tabu search for the dynamic bipartite drawing problem","volume":"91","author":"mart\u00ed","year":"2018","journal-title":"Comput Oper Res"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2949860"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2846646"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2017.08.004"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.01.068"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2915673"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.12.008"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"MAX–MIN ant system","volume":"16","author":"mahi","year":"2000","journal-title":"Future Gener Comput Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-016-9115-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1402135"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.02.017"},{"key":"ref20","article-title":"Single bitmap block truncation coding of color images using hill climbing algorithm","author":"zhang","year":"2018","journal-title":"arXiv 1807 04960"},{"key":"ref22","first-page":"292","article-title":"Multi-verse optimization based evolutionary programming technique for power scheduling in loss minimization scheme","volume":"8","author":"lokman","year":"2019","journal-title":"IAES Int J Artif Intell"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1162\/106365603321828970"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2547-1"},{"key":"ref23","first-page":"880","article-title":"Dynamic grouping ant colony algorithm combined with cat swarm optimization","volume":"14","author":"zhang","year":"2020","journal-title":"Journal of Frontiers of Computer Science and Technology"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.02.021"},{"key":"ref25","first-page":"1","article-title":"An improved fruit fly optimization algorithm and its application in heat exchange fouling ultrasonic detection","volume":"2018","author":"li","year":"2018","journal-title":"Math Problems Eng"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09141250.pdf?arnumber=9141250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:09:40Z","timestamp":1641949780000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9141250\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3009399","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}