{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:59:02Z","timestamp":1772297942866,"version":"3.50.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572237"],"award-info":[{"award-number":["61572237"]}],"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":["61573167"],"award-info":[{"award-number":["61573167"]}],"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":[[2016]]},"DOI":"10.1109\/access.2016.2604738","type":"journal-article","created":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T18:49:49Z","timestamp":1472755789000},"page":"9400-9412","source":"Crossref","is-referenced-by-count":68,"title":["Convergence Analysis and Improvement of the Chicken Swarm Optimization Algorithm"],"prefix":"10.1109","volume":"4","author":[{"given":"Dinghui","family":"Wu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7675-1159","authenticated-orcid":false,"given":"Shipeng","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Fei","family":"Kong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","first-page":"67","author":"zhang","year":"2003","journal-title":"Math Foundation to GA"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.19"},{"key":"ref31","author":"qian","year":"2014","journal-title":"Stochastic Processes Applicat"},{"key":"ref30","article-title":"Analysis and application of particle swarm optimization","author":"li","year":"2006","journal-title":"J Huazhong Univ Sci Technol"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/4235.985692"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.835176"},{"key":"ref35","first-page":"53","article-title":"Study on the strategy of decreasing inertia weight in particle swarm optimization algorithm","volume":"40","author":"chen","year":"2006","journal-title":"J Xi’an Jiao Tong Univ"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00447-7"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.08.002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.08.157"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-012-0254-1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2014.958734"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3233\/AIC-150677"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.4304\/jmm.4.4.204-214"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.04.016"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-015-2252-5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.03.006"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2003.12.015"},{"key":"ref28","first-page":"1646","article-title":"An almost everywhere strong convergence proof for a class of ant colony algorithm","volume":"37","author":"su","year":"2009","journal-title":"Acta Electron Sin"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2013.06.001"},{"key":"ref27","first-page":"462","article-title":"The global convergence analysis of particle swarm optimization algorithm based on Markov chain","volume":"28","author":"ren","year":"2011","journal-title":"Control Theory Appl"},{"key":"ref3","first-page":"854","article-title":"Cat swarm optimization","volume":"6","author":"chu","year":"2006","journal-title":"Proc Pacific Rim Int Conf Artif Intell"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1063\/1.2817338","article-title":"Monkey search: A novel metaheuristic search for global optimization","volume":"953","author":"mucherino","year":"2007","journal-title":"Data Mining Syst Anal Optim Biomed"},{"key":"ref29","first-page":"1554","article-title":"Convergence analysis of artificial bee colony algorithm","volume":"28","author":"ning","year":"2013","journal-title":"Control Decision"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDIM.2012.6360147"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.05.002"},{"key":"ref7","first-page":"65","article-title":"A new metaheuristic bat-inspired algorithm","volume":"284","author":"yang","year":"2010","journal-title":"Studies in Computational Intelligence"},{"key":"ref2","first-page":"1","article-title":"A review of population-based meta-heuristic algorithms","volume":"5","author":"beheshti","year":"2013","journal-title":"Int J Adv Soft Comput Appl"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2010.04.014"},{"key":"ref1","first-page":"1","article-title":"A brief review of nature-inspired algorithms for optimization","volume":"80","author":"fister","year":"2013","journal-title":"Elektr Rev"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.884042"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2016.03.016"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.04.054"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-319-11857-4_10","article-title":"A new bio-inspired algorithm: Chicken swarm optimization","volume":"8794","author":"meng","year":"2014","journal-title":"Advances in Swarm Intelligence"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2016.05.024"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01007975"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CYBER.2015.7288023"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/7419931\/07558196.pdf?arnumber=7558196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:26:37Z","timestamp":1642004797000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7558196\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/access.2016.2604738","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}