{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:57Z","timestamp":1740169137044,"version":"3.37.3"},"reference-count":38,"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","61075115","61403249","61603242"],"award-info":[{"award-number":["61673258","61075115","61403249","61603242"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","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":[[2019]]},"DOI":"10.1109\/access.2019.2948395","type":"journal-article","created":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T23:27:10Z","timestamp":1571700430000},"page":"152646-152657","source":"Crossref","is-referenced-by-count":4,"title":["KL Divergence-Based Pheromone Fusion for Heterogeneous Multi-Colony Ant Optimization"],"prefix":"10.1109","volume":"7","author":[{"given":"Mingxia","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3879-6329","authenticated-orcid":false,"given":"Xiaoming","family":"You","sequence":"additional","affiliation":[]},{"given":"Xingxing","family":"Yu","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":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2832640"},{"key":"ref33","first-page":"4873","article-title":"Adaptive ant colony algorithm based on information entropy","volume":"31","author":"xiao","year":"2010","journal-title":"Eng Comput"},{"key":"ref32","first-page":"9","article-title":"Multiple heterogeneous ant colonies algorithm based on information entropy","volume":"44","author":"deng","year":"2009","journal-title":"Comput Eng Appl"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2015.2434953"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2011.6115851"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2018.2867577"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s12204-019-2039-9"},{"key":"ref35","first-page":"1","article-title":"A new ant colony system updating strategy for vehicle routing problem with time windows","author":"ellabib","year":"2003","journal-title":"Proc 5th Metaheuristics Int Conf (MIC)"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2768665"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.06.004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-010-0680-1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MSNA.2012.6324605"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.06.049"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.01.068"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.20965\/jaciii.2007.p0433"},{"key":"ref16","first-page":"15","article-title":"Adaptive dynamic chaotic ant colony algorithm based on degree of aggregation heterogeneous","volume":"55","author":"liu","year":"2019","journal-title":"Comput Eng Appl"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.09.016"},{"key":"ref18","first-page":"224","article-title":"An efficient ant colony system for vehicle routing problems with time windows","volume":"10","author":"silva","year":"2011","journal-title":"International Journal of Logistic Management"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2017.01.001"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2917838"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2018.10.037"},{"key":"ref27","first-page":"569","article-title":"Hybrid max–min ant system with four vertices and three lines inequality for traveling salesman problem","volume":"19","author":"wang","year":"2015","journal-title":"Soft Comput"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.04.012"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICINFA.2010.5512118"},{"key":"ref5","first-page":"25","article-title":"A new rank based version of the ant system—A computational study","volume":"7","author":"bullnheimer","year":"1997","journal-title":"Cent Eur J Oper Res"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2556742"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2071-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2746569"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2915673"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2900029"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.10.012"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2897580"},{"key":"ref26","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":"ref25","first-page":"319","article-title":"Application of an improved ant colony optimization on generalized traveling salesman problem","author":"kan","year":"2012","journal-title":"Proc ICFP"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08877821.pdf?arnumber=8877821","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:39:43Z","timestamp":1628624383000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8877821\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2948395","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}