{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T07:23:25Z","timestamp":1778570605263,"version":"3.51.4"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3133579","type":"journal-article","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T20:36:03Z","timestamp":1638909363000},"page":"161745-161760","source":"Crossref","is-referenced-by-count":16,"title":["A Modification of the Imperialist Competitive Algorithm With Hybrid Methods for Constrained Optimization Problems"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8017-5497","authenticated-orcid":false,"given":"Jianfu","family":"Luo","sequence":"first","affiliation":[]},{"given":"Jinsheng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Xi","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1002\/int.22535"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.08.031"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.10.048"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.10.013"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.04.055"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2017.10.021"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/423642"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.07.105"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2012.07.010"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.11.026"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-03995-9"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107408"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/er.4767"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1108\/AA-10-2017-127"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1481301"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2885030"},{"key":"ref15","first-page":"697","article-title":"Imperialist competitive algorithm with effective assimilation strategy: A comparative study on numerical benchmark functions","volume":"55","author":"elnaz","year":"2020","journal-title":"IETE J Res"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-011-0754-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-2138-y"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2018.2829463"},{"key":"ref19","first-page":"1663","article-title":"An imperialist competitive algorithm for solving constrained optimization problem","volume":"34","author":"lei","year":"2019","journal-title":"Control Decis"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9637-0"},{"key":"ref4","first-page":"2047","article-title":"Constrained multi-objective optimization algorithm with adaptive—Truncation strategy","volume":"36","author":"bi","year":"2016","journal-title":"Electrotech Inf Tech"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1588-6"},{"key":"ref3","first-page":"577","article-title":"Novel bi-objective model-based evolutionary algorithm for constrained optimization problems","volume":"31","author":"dong","year":"2014","journal-title":"Control Theory Appl"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.24846\/v29i1y202008"},{"key":"ref5","first-page":"715","article-title":"Dual population constrained optimization algorithm with hybrid strategy","volume":"30","author":"bi","year":"2015","journal-title":"Control Decis"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9149-x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(99)00389-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4425083"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2011.2162498"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2016.10.082"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2019.1633023"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-3587-x"},{"key":"ref42","first-page":"893","article-title":"Gravitational search algorithm based on improved tent chaos","volume":"35","author":"zhang","year":"2020","journal-title":"Control Decis"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2937747"},{"key":"ref41","first-page":"45","article-title":"Research on multiple accesses of SPC-TDCS based on modified logistic chaotic sequence","volume":"17","author":"li","year":"2016","journal-title":"Journal of Air Force Engineering University"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2019.02.194"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2419-0"},{"key":"ref43","first-page":"8","article-title":"Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization","volume":"41","author":"liang","year":"2006","journal-title":"J Appl Mech"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1111\/coin.12160"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09641814.pdf?arnumber=9641814","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,8]],"date-time":"2022-03-08T22:03:15Z","timestamp":1646776995000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9641814\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3133579","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}