{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:35:17Z","timestamp":1743078917280,"version":"3.37.3"},"reference-count":61,"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":"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.3019445","type":"journal-article","created":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T20:24:23Z","timestamp":1598387063000},"page":"155459-155476","source":"Crossref","is-referenced-by-count":7,"title":["High-Frequency Path Mining-Based Reward and Punishment Mechanism for Multi-Colony Ant Colony Optimization"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5447-2156","authenticated-orcid":false,"given":"Han","family":"Pan","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":[{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.3390\/s19081837"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1016\/j.eswa.2011.02.151"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1007\/s00521-017-2912-0"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1016\/j.ins.2012.02.055"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1016\/j.ins.2017.04.016"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1016\/j.asoc.2016.03.001"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1016\/j.cogsys.2020.03.001"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1109\/ACCESS.2020.2985498"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1016\/j.egypro.2012.02.101"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1109\/SSCI.2018.8628805"},{"doi-asserted-by":"publisher","key":"ref60","DOI":"10.1109\/ISCID.2016.2085"},{"doi-asserted-by":"publisher","key":"ref61","DOI":"10.1109\/ICICTA.2010.731"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1016\/j.swevo.2017.07.004"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1016\/S0167-739X(00)00043-1"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/ECTICon.2017.8096261"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1007\/s00521-019-04629-4"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.3233\/IDT-170318"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1007\/s00500-014-1279-8"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1016\/j.engappai.2014.03.007"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1016\/j.eswa.2018.09.045"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1007\/s12555-016-0443-6"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1155\/2017\/3920327"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/4235.585892"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/3477.484436"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1109\/ACCESS.2017.2746569"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1109\/ACCESS.2019.2915673"},{"doi-asserted-by":"publisher","key":"ref59","DOI":"10.1109\/ICNC.2007.675"},{"doi-asserted-by":"publisher","key":"ref58","DOI":"10.1007\/s00521-019-04172-2"},{"doi-asserted-by":"publisher","key":"ref57","DOI":"10.1016\/j.asoc.2017.06.049"},{"key":"ref56","first-page":"1","article-title":"A novel ant colony optimization based on game for traveling salesman problem","author":"yang","year":"2020","journal-title":"Appl Intell"},{"doi-asserted-by":"publisher","key":"ref55","DOI":"10.1109\/ACCESS.2020.2967076"},{"doi-asserted-by":"publisher","key":"ref54","DOI":"10.1109\/CEC.2015.7256934"},{"doi-asserted-by":"publisher","key":"ref53","DOI":"10.1109\/CAC.2018.8623138"},{"doi-asserted-by":"publisher","key":"ref52","DOI":"10.1007\/978-3-319-78133-4_11"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","article-title":"Evolutionary programming made faster","volume":"3","author":"yao","year":"1999","journal-title":"IEEE Trans Evol Comput"},{"year":"1992","author":"dorigo","article-title":"Optimization, learning and natural algorithms","key":"ref11"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"29","DOI":"10.2991\/ijndc.2018.7.1.4","article-title":"Modified ant colony optimization algorithm for multiple-vehicle traveling salesman problems","volume":"7","author":"yindee","year":"2018","journal-title":"Int J Netw Distrib Comput"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/ICNN.1995.488968"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1007\/s10898-007-9149-x"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1016\/j.knosys.2011.07.001"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1007\/978-3-319-11680-8_29"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1631\/FITEE.1601364"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1007\/978-3-319-76357-6_14"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1007\/978-3-642-24553-4_75"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2019.105887","article-title":"Discrete spider monkey optimization for travelling salesman problem","volume":"86","author":"akhand","year":"2020","journal-title":"Appl Soft Comput"},{"key":"ref4","first-page":"1","article-title":"Enhanced a hybrid moth-flame optimization algorithm using new selection schemes","volume":"36","author":"shehab","year":"2020","journal-title":"Eng Comput"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1007\/s00521-019-04570-6"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1111\/j.1540-5915.1977.tb01074.x"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"kirkpatrick","year":"1983","journal-title":"Science"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1007\/BF00175354"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1016\/0004-3702(95)00040-2"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.3390\/ijgi6060161"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1007\/978-3-0348-5927-1_5"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1007\/s00500-016-2432-3"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1016\/j.asoc.2015.01.068"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1109\/ACCESS.2019.2900029"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1007\/s11269-018-2048-8"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1016\/j.matcom.2018.08.011"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1007\/978-3-319-59060-8_58"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.2298\/TSCI131124023Z"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1155\/2016\/8932896"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09177122.pdf?arnumber=9177122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T08:36:52Z","timestamp":1696581412000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9177122\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":61,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3019445","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}