{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T15:24:58Z","timestamp":1772810698325,"version":"3.50.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"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":["61673331"],"award-info":[{"award-number":["61673331"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Program","doi-asserted-by":"publisher","award":["KQTD2016112514355531"],"award-info":[{"award-number":["KQTD2016112514355531"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1109\/tcyb.2020.3005047","type":"journal-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T20:27:28Z","timestamp":1596227248000},"page":"3147-3158","source":"Crossref","is-referenced-by-count":24,"title":["A New Crossover Mechanism for Genetic Algorithms for Steiner Tree Optimization"],"prefix":"10.1109","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8452-0745","authenticated-orcid":false,"given":"Qiongbing","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7222-4917","authenticated-orcid":false,"given":"Shengxiang","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Informatics, De Montfort University, Leicester, U.K."}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8217-4108","authenticated-orcid":false,"given":"Min","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0722-152X","authenticated-orcid":false,"given":"Jianxun","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5654-7748","authenticated-orcid":false,"given":"Lei","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2250955"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2451595"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2436-z"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CSCI.2015.67"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CCDC.2016.7531814"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2004.12.012"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2008.03.005"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/986985"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2011.03.026"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.112012.121467"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.aci.2017.12.003"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/4235.850653"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-016-1399-4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.08.015"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.07.054"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36087-5_32"},{"key":"ref17","volume-title":"How to encode a tree","author":"Picciotto","year":"2017"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_27"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2016.05.001"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2000.904824"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/bf01386390"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-014-9416-y"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010024515191"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-015-9243-7"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2010.10.011"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2015.11.054"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2010.10.008"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488516500264"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2070-9"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-014-1269-x"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.871249"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00039-7"},{"issue":"7","key":"ref34","first-page":"685","article-title":"Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm","volume":"24","author":"Wang","year":"2001","journal-title":"Comput. Commun."},{"key":"ref35","volume-title":"Genetic Algorithms for Optimization: Background and Applications","author":"Hue","year":"1997"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/11893295_89"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2342713"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.06.043"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/9778253\/09153917.pdf?arnumber=9153917","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T00:15:43Z","timestamp":1704845743000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9153917\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5]]},"references-count":38,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2020.3005047","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5]]}}}