{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:51:03Z","timestamp":1767340263607,"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":"National 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":"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":[[2020]]},"DOI":"10.1109\/access.2020.2967076","type":"journal-article","created":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T21:06:26Z","timestamp":1579295186000},"page":"53250-53260","source":"Crossref","is-referenced-by-count":15,"title":["Multi-Colony Ant Algorithm Using Both Generative Adversarial Nets and Adaptive Stagnation Avoidance Strategy"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9762-3738","authenticated-orcid":false,"given":"Lingwu","family":"Meng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3879-6329","authenticated-orcid":false,"given":"Xiaoming","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5790-4324","authenticated-orcid":false,"given":"Sheng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2321-4779","authenticated-orcid":false,"given":"Shundong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2915673"},{"key":"ref32","first-page":"1393","article-title":"An effective dynamic weighted rule for ant colony system optimization","author":"lee","year":"2001","journal-title":"Proc Congr Evol Comput"},{"key":"ref31","volume":"2","author":"sutton","year":"1998","journal-title":"Introduction to Reinforcement Learning"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2432-3"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.01.068"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2900029"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0819-9_3"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CIS.2008.151"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.oceaneng.2015.04.028"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2017.01.001"},{"key":"ref14","first-page":"679","article-title":"Collaborative hardware\/software partition of coarse-grained reconfigurable system using evolutionary ant colony optimization","author":"wang","year":"2008","journal-title":"Proc Asia South Pacific Design Autom Conf"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1837","DOI":"10.3390\/s19081837","article-title":"Dynamic flying ant colony optimization (DFACO) for solving the traveling salesman problem","volume":"19","author":"hindi","year":"2019","journal-title":"SENSORS"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/BIFE.2009.26"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.09.038"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2019.03.185"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s11431-017-9235-y"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20466-6_22"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13495-1_73"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3444-y"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.02.009"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-013-0993-y"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11269-018-2048-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0608-4"},{"key":"ref7","first-page":"v7-605","article-title":"A new method for multi-objective optimization problem based on multi-ant-colony algorithm","volume":"7","author":"liu","year":"2010","journal-title":"Proc Int Conf Comput Appl Syst Modeling (ICCASM)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s12555-017-0451-1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.02.104"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/WiCom.2008.843"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICIECS.2009.5365328"},{"key":"ref24","first-page":"2672","article-title":"Generative adversarial nets","author":"goodfellow","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"article-title":"Multi-agent reinforcement learning based on quantum andant colony algorithm theory","year":"0","author":"tan","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-019-06127-1"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/wer.1027"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/08962051.pdf?arnumber=8962051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:09:17Z","timestamp":1641949757000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8962051\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2967076","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}