{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T15:42:55Z","timestamp":1783438975236,"version":"3.54.6"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876025"],"award-info":[{"award-number":["61876025"]}],"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":["61876162"],"award-info":[{"award-number":["61876162"]}],"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":["61872049"],"award-info":[{"award-number":["61872049"]}],"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":["61602181"],"award-info":[{"award-number":["61602181"]}],"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":["61871272"],"award-info":[{"award-number":["61871272"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013160","name":"Venture & Innovation Support Program for Chongqing Overseas Returnees","doi-asserted-by":"publisher","award":["cx2019020"],"award-info":[{"award-number":["cx2019020"]}],"id":[{"id":"10.13039\/501100013160","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013160","name":"Venture & Innovation Support Program for Chongqing Overseas Returnees","doi-asserted-by":"publisher","award":["cx2018044"],"award-info":[{"award-number":["cx2018044"]}],"id":[{"id":"10.13039\/501100013160","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007567","name":"City University of Hong Kong Research Fund","doi-asserted-by":"publisher","award":["9610397"],"award-info":[{"award-number":["9610397"]}],"id":[{"id":"10.13039\/100007567","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Scientific Research and Development Funding Program","award":["JCYJ20180307123637294"],"award-info":[{"award-number":["JCYJ20180307123637294"]}]},{"name":"Shenzhen Scientific Research and Development Funding Program","award":["JCYJ20170302154328155"],"award-info":[{"award-number":["JCYJ20170302154328155"]}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council of the Hong Kong","doi-asserted-by":"publisher","award":["CityU11202418"],"award-info":[{"award-number":["CityU11202418"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council of the Hong Kong","doi-asserted-by":"publisher","award":["CityU11209219"],"award-info":[{"award-number":["CityU11209219"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1109\/tcyb.2020.2974100","type":"journal-article","created":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T22:37:01Z","timestamp":1583534221000},"page":"2563-2576","source":"Crossref","is-referenced-by-count":221,"title":["Toward Adaptive Knowledge Transfer in Multifactorial Evolutionary Computation"],"prefix":"10.1109","volume":"51","author":[{"given":"Lei","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liang","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kay Chen","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinghui","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zexuan","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"487","article-title":"Genetic crossover operator for partially separable functions","author":"durand","year":"1998","journal-title":"Proc 3rd Annu Conf Genet Program"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.925798"},{"key":"ref33","first-page":"305","article-title":"A note on usefulness of geometrical crossover for numerical optimization problems","volume":"5","author":"michalewicz","year":"1996","journal-title":"Evolution Programs"},{"key":"ref32","author":"b\u00e4ck","year":"1992","journal-title":"A User’s Guide to Genesys 1 0"},{"key":"ref31","first-page":"107","article-title":"Analysing crossover operators by search step size","author":"lin","year":"1997","journal-title":"Proc IEEE Int Conf Evol Comput"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277252"},{"key":"ref37","article-title":"Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization","author":"liang","year":"2013"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref35","article-title":"Evolutionary multitasking for multiobjective continuous optimization: Benchmark problems, performance metrics and baseline results","author":"yuan","year":"2017"},{"key":"ref34","article-title":"Evolutionary multitasking for single-objective continuous optimization: Benchmark problems, performance metric, and baseline results","author":"da","year":"2017"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1287\/msom.1050.0085"},{"key":"ref27","first-page":"2","article-title":"New variations of order crossover for travelling salesman problem","volume":"2","author":"deep","year":"2011","journal-title":"Int J Combinat Optim Problems Inform"},{"key":"ref29","first-page":"154","article-title":"AllelesLociand the traveling salesman problem","author":"goldberg","year":"1985","journal-title":"Proc 1st Int Conf Genet Algorithms"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-016-9395-7"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2458037"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2536167"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0427-8_20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/2.294849"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.09.005"},{"key":"ref23","first-page":"2","article-title":"Uniform crossover in genetic algorithms","author":"syswerda","year":"1989","journal-title":"Proc 3rd Int Conf Genet Algorithms"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1162\/106365601750190406"},{"key":"ref25","first-page":"115","article-title":"Simulated binary crossover for continuous search space","volume":"9","author":"agrawal","year":"1995","journal-title":"Complex Syst"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277190"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.17148\/IARJSET.2015.2305"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2017.7969579"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2017.7969454"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2844324"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2785351"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2893614"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2017.7969596"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/538"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2906927"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3009966"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542361"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830649"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28270-1_5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2016.7744178"},{"key":"ref6","first-page":"1","article-title":"Evolutionary multitasking in combinatorial search spaces: A case study in capacitated vehicle routing problem","author":"zhou","year":"2016","journal-title":"Proc IEEE Symp Comput Intell (SSCI)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI.2016.7850038"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TENCON.2016.7848632"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-016-0011-y"},{"key":"ref49","first-page":"187","article-title":"Real-coded genetic algorithms and interval-schemata","volume":"2","author":"eshelman","year":"2014","journal-title":"Found Genet Algorithms"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2554622"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(89)90179-6"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03315-9"},{"key":"ref48","first-page":"104","article-title":"Fuzzy recombination for the breeder genetic algorithm","author":"voigt","year":"1995","journal-title":"Proceedings of the 6th International Conference on Genetic Algorithms"},{"key":"ref47","first-page":"205","article-title":"Genetic algorithms for real parameter optimization","volume":"1","author":"wright","year":"2014","journal-title":"Found Genet Algorithms"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1002\/int.10091"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2394466"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.782011"},{"key":"ref43","first-page":"73","article-title":"Crossover, macromutation, and population-based search","author":"jones","year":"1995","journal-title":"Proceedings of the 6th International Conference on Genetic Algorithms"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/9405232\/09027113.pdf?arnumber=9027113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:29Z","timestamp":1652194409000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9027113\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":51,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2020.2974100","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5]]}}}