{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T22:17:37Z","timestamp":1780438657622,"version":"3.54.1"},"reference-count":74,"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":[{"name":"the Key Research and Development Program of Shanxi Province","award":["201803D121039"],"award-info":[{"award-number":["201803D121039"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["21606159"],"award-info":[{"award-number":["21606159"]}],"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":[[2020]]},"DOI":"10.1109\/access.2020.2980300","type":"journal-article","created":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T20:25:17Z","timestamp":1584044717000},"page":"1-1","source":"Crossref","is-referenced-by-count":20,"title":["An Improved Crow Search Algorithm Based on Spiral Search Mechanism for Solving Numerical and Engineering Optimization Problems"],"prefix":"10.1109","author":[{"given":"Xiaoxia","family":"Han","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quanxi","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lin","family":"Yue","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yingchao","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gang","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinying","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(99)00389-8"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.2514\/3.10834"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1080\/02630250008970288"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2014.04.005"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2006.873185"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.conbuildmat.2020.118216"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.est.2019.101040"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SPEEDAM.2018.8445209"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CEFC.2016.7815927"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2911629"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2018.04.014"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105522"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.10.009"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICOEI.2019.8862669"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2018.8477975"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2012.09.003"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2014.03.007"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1115\/1.1561044"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-2988-6"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2015.01.010"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-17275"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1870-7"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.isatra.2014.03.018"},{"key":"ref29","article-title":"Development and applications of an intelligent crow search algorithm based on opposition based learning","author":"shekhawat","year":"2019","journal-title":"ISA Trans"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.11.026"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1080\/03052159508941187"},{"key":"ref68","first-page":"30","article-title":"A combined genetic adaptive search (GeneAS) for engineering design","volume":"26","author":"deb","year":"1996","journal-title":"Comput Sci Inf"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1115\/1.2919393"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/9780470640425"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-27705-6_6"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908961"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2016.03.001"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.01.026"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2897325"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISCID.2017.140"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.06.040"},{"key":"ref50","article-title":"Test problems in optimization","author":"yang","year":"2010","journal-title":"arXiv 1008 0549"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105744"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2006.11.020"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1080\/03081070701303470"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-3615(99)00046-9"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.11.033"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.07.006"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-018-0066-z"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2894-y"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3102-4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-011-0241-y"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.11.032"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","article-title":"Particle swarm optimization","volume":"4","author":"eberhart","year":"1995","journal-title":"Proc IEEE Int Conf Neural Netw"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2017.07.002"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.02.028"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.03.004"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1177\/003754970107600201"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.2013.2238654"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.122621"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIC.2010.032124"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/9781119454816"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0792-66"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.919004"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-81283-5_8"},{"key":"ref49","article-title":"Test functions for optimization needs","volume":"101","author":"molga","year":"2005"},{"key":"ref9","article-title":"An idea based on honey bee swarm for numerical optimization","author":"karaboga","year":"2005"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2905009"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.21629\/JSEE.2018.02.19"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1080\/00207160108805080"},{"key":"ref47","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"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.23919\/ChiCC.2018.8483575"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CFIS.2017.8003677"},{"key":"ref44","first-page":"35","article-title":"Exploration and exploitation in evolutionary algorithms: A survey","volume":"45","author":"?repin\u0161ek","year":"2013","journal-title":"ACM Comput Surv"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.03.039"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/6514899\/09034005.pdf?arnumber=9034005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:52:17Z","timestamp":1639770737000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9034005\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":74,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2980300","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}